Method and system for encoding wide striped cells

ABSTRACT

A system and method for encoding wide striped cells that carry packets of data across stripes. The method encodes an initial block of a first wide striped cell is encoded with initial cell encoding information, and distributes initial bytes of packet data into available space in the initial block of the first wide striped cell. The initial cell encoding information includes control information and state information. One initial block of the first wide striped cell comprises five subblocks corresponding to five stripes. Each subblock includes identical control information and identical state information. The method further includes adding reserve information to available bytes at the end of the initial block of the first wide striped cell. Remaining bytes of packet data are distributed across one or more blocks in the first wide striped cell until an end of packet condition is reached or a maximum cell size is reached. Other steps include encoding the first wide striped cell or another wide striped cell with end of packet information. The end of packet information varies depending upon a set of end of packet conditions, such as, whether the end of packet occurs at the end of an initial block, at the end of the initial block, within a subsequent block, at a block boundary, or at a cell boundary.

CROSS-REFERENCE TO RELATED APPLICATION

This application claims priority based on parent application Ser. No.09/855,024, entitled “METHOD AND SYSTEM FOR ENCODING WIDE STRIPED CELLS”by Andrew Chang, Ronak Patel and Ming Wong, filed on May 15, 2001, nowU.S. Pat. No. 6,735,218, which was based on U.S. Provisional ApplicationSer. No. 60/249,871, entitled “METHOD AND SYSTEM FOR ENCODING WIDESTRIPED CELLS” by Andrew Chang, Ronak Patel and Ming Wong, filed on Nov.17, 2000.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The invention relates generally to network switches.

2. Background Art

A network switch is a device that provides a switching function (i.e.,determines a physical path) in a data communications network. Switchinginvolves transferring information, such as digital data packets orframes, among entities of the network. Typically, a switch is a computerhaving a plurality of circuit cards coupled to a backplane. In theswitching art, the circuit cards are typically called “blades.” Theblades are interconnected by a “switch fabric.” Each blade includes anumber of physical ports that couple the switch to the other networkentities over various types of media, such as Ethernet, FDDI (FiberDistributed Data Interface), or token ring connections. A network entityincludes any device that transmits and/or receives data packets oversuch media.

The switching function provided by the switch typically includesreceiving data at a source port from a network entity and transferringthe data to a destination port. The source and destination ports may belocated on the same or different blades. In the case of “local”switching, the source and destination ports are on the same blade.Otherwise, the source and destination ports are on different blades andswitching requires that the data be transferred through the switchfabric from the source blade to the destination blade. In some case, thedata may be provided to a plurality of destination ports of the switch.This is known as a multicast data transfer.

Switches operate by examining the header information that accompaniesdata in the data frame. The header information includes theinternational standards organization (ISO) 7-layer OSI (open-systemsinterconnection model). In the OSI model, switches generally route dataframes based on the lower level protocols such as Layer 2 or Layer 3. Incontrast, routers generally route based on the higher level protocolsand by determining the physical path of a data frame based on tablelook-ups or other configured forwarding or management routines todetermine the physical path (i.e., route).

Ethernet is a widely used lower-layer network protocol that usesbroadcast technology. The Ethernet frame has six fields. These fieldsinclude a preamble, a destination address, source address, type, dataand a frame check sequence. In the case of an ethernet frame, thedigital switch will determine the physical path of the frame based onthe source and destination addresses. Standard Ethernet operates at aten Mbit/s data rate. Another implementation of Ethernet known as “FastEthernet” (FE) has a data rate of 100 Megabits/s. Yet anotherimplementation of FE operates at 10 Gigabits/sec.

A digital switch will typically have physical ports that are configuredto communicate using different protocols at different data rates. Forexample, a blade within a switch may have certain ports that are 10Mbit/s, or 100 Mbit/s ports. It may have other ports that conform tooptical standards such as SONET and are capable of such data rates as 10gigabits per second.

A performance of a digital switch is often assessed based on metricssuch as the number of physical ports that are present, and the totalbandwidth or number of bits per second that can be switched withoutblocking or slowing the data traffic. A limiting factor in the bitcarrying capacity of many switches is the switch fabric. For example,one conventional switch fabric was limited to 8 gigabits per second perblade. In an eight blade example, this equates to 64 gigabits per secondof traffic. It is possible to increase the data rate of a particularblade to greater than 8 gigabits per second. However, the switch fabricwould be unable to handle the increased traffic.

It is desired to take advantage of new optical technologies and increaseport densities and data rates on blades. However, what is needed is aswitch and a switch fabric capable of handling higher bit rates andproviding a maximum aggregate bit carrying capacity well in excess ofconventional switches.

BRIEF SUMMARY OF THE INVENTION

The present invention provides a high-performance network switch. Seriallink technology is used in a switching fabric. Serial data streams,rather than parallel data streams, are switched in a switching fabric.Blades output serial data streams in serial pipes. A serial pipe can bea number of serial links coupling a blade to the switching fabric. Theserial data streams represent an aggregation of input serial datastreams provided through physical ports to a respective blade. Eachblade outputs serial data streams with in-band control information inmultiple stripes to the switching fabric.

In one embodiment, the serial data streams carry packets of data in widestriped cells across multiple stripes. Wide striped cells are encoded.In-band control information is carried in one or more blocks of a widecell. For example, the initial block of a wide cell includes controlinformation and state information. Further, the control information andstate information is carried in each stripe. In particular, the controlinformation and state information is carried in each subblock of theinitial block of a wide cell. In this way, the control information andstate information is available in-band in the serial data streams (alsocalled stripes). Control information is provided in-band to indicatetraffic flow conditions, such as, a start of cell, an end of packet,abort, or other error conditions.

A wide cell has one or more blocks. Each block extends across fivestripes. Each block has a size of twenty bytes made up of five subblockseach having a size of four bytes. In one example, a wide cell has amaximum size of eight blocks (160 bytes) which can carry a 148 bytes ofpayload data and 12 bytes of in-band control information. Packets ofdata for full-duplex traffic can be carried in the wide cells at a 50Gb/sec rate in each direction through one slot of the digital switch.According to one feature, the choice of maximum wide cell block size of160 bytes as determined by the inventors allows a 4×10 Gigabit/secEthernet (also called 4×10 GE) line rate to be maintained through thebackplane interface adapter. This line rate is maintained for Ethernetpackets having a range of sizes accepted in the Ethernet standardincluding, but not limited to, packet sizes between 84 and 254 bytes.

In one embodiment, a digital switch has a plurality of blades coupled toa switching fabric via serial pipes. The switching fabric can beprovided on a backplane and/or one or more blades. Each blade outputsserial data streams with in-band control information in multiple stripesto the switching fabric. The switching fabric includes a plurality ofcross points corresponding to the multiple stripes. Each cross point hasa plurality of port slices coupled to the plurality of blades. In oneembodiment five stripes and five five cross points are used. Each bladehas five serial links coupled to each of the five cross pointsrespectively. In one example implementation, the serial pipe coupling ablade to switching fabric is a 50 Gb/s serial pipe made up of five 10Gb/s serial links. Each of the 10 Gb/s serial links is coupled to arespective cross point and carries a serial data stream. The serial datastream includes a data slice of a wide cell that corresponds to onestripe.

In one embodiment of the present invention, each blade has a backplaneinterface adapter (BIA). The BIA has three traffic processing flowpaths. The first traffic processing flow path extends in traffic flowdirection from local packet processors toward a switching fabric. Thesecond traffic processing flow path extends in traffic flow directionfrom the switching fabric toward local packet processors. A thirdtraffic processing flow path carried local traffic from the firsttraffic processing flow path. This local traffic is sorted and routedlocally at the BIA without having to go through the switching fabric.

The BIA includes one or more receivers, wide cell generators, andtransmitters along the first path. The receivers receive narrow inputcells carrying packets of data. These narrow input cells are output frompacket processor(s) and/or from integrated bus translators (IBTs)coupled to packet processors. The BIA includes one or more wide cellgenerators. The wide cell generators generate wide striped cellscarrying the packets of data received by the BIA in the narrow inputcells. The transmitters transmit the generated wide striped cells inmultiple stripes to the switching fabric.

According to the present invention, the wide cells extend acrossmultiple stripes and include in-band control information in each stripe.In one embodiment, each wide cell generator parses each narrow inputcell, checks for control information indicating a start of packet,encodes one or more new wide striped cells until data from all narrowinput cells of the packet is distributed into the one or more new widestriped cells, and writes the one or more new wide striped cells into aplurality of send queues.

In one example, the BIA has four deserializer receivers, 56 wide cellgenerators, and five serializer transmitters. The four deserializerreceivers receive narrow input cells output from up to eight originatingsources (that is, up to two IBTs or packet processors per deserializerreceiver). The 56 wide cell generators receive groups of the receivednarrow input cells sorted based on destination slot indentifier andoriginating source. The five serializer transmitters transmit the dataslices of the wide cell that corresponds to the stripes.

According to a further feature, a BIA can also include a traffic sorterwhich sorts received narrow input cells based on a destination slotidentifier. In one example, the traffic sorter comprises both aglobal/traffic sorter and a backplane sorter. The global/traffic sortersorts received narrow input cells having a destination slot identifierthat identifies a local destination slot from received narrow inputcells having destination slot identifier that identifies globaldestination slots across the switching fabric. The backplane sorterfurther sorts received narrow input cells having destination slotidentifiers that identify global destination slots into groups based onthe destination slot identifier.

In one embodiment, the BIA also includes a plurality of stripe sendqueues and a switching fabric transmit arbitrator. The switching fabrictransmit arbitrator arbitrates the order in which data stored in thestripe send queues is sent by the transmitters to the switching fabric.In one example, the arbitration proceeds in a round-robin fashion. Eachstripe send queue stores a respective group of wide striped cellscorresponding a respective originating source packet processor and adestination slot identifier. Each wide striped cell has one or moreblocks across multiple stripes. During a processing cycle, the switchingfabric transmit arbitrator selects a stripe send queue and pushes thenext available cell (or even one or more blocks of a cell at time) tothe transmitters. Each stripe of a wide cell is pushed to the respectivetransmitter for that stripe.

The BIA includes one or more receivers, wide/narrow cell translators,and transmitters along the second path. The receivers receive widestriped cells in multiple stripes from the switching fabric. The widestriped cells carry packets of data. The translators translate thereceived wide striped cells to narrow input cells carrying the packetsof data. The transmitters then transmit the narrow input cells tocorresponding destination packet processors or IBTs. In one example, thefive deserializer receivers receive five subblocks of wide striped cellsin multiple stripes. The wide striped cells carrying packets of dataacross the multiple stripes and including destination slot identifierinformation.

In one embodiment, the BIA further includes stripe interfaces and stripereceive synchronization queues. Each stripe interface sorts receivedsubblocks in each stripe based on originating slot identifierinformation and stores the sorted received subblocks in the stripereceive synchronization queues.

The BIA further includes along the second traffic flow processing pathan arbitrator, a striped-based wide cell assembler, and the narrow/widecell translator. The arbitrator arbitrates an order in which data storedin the stripe receive synchronization queues is sent to thestriped-based wide cell assembler. The striped-based wide cell assemblerassembles wide striped cells based on the received subblocks of data. Anarrow/wide cell translator then translates the arbitrated received widestriped cells to narrow input cells carrying the packets of data.

A second level of arbitration is also provided according to anembodiment of the present invention. The BIA further includesdestination queues and a local destination-transmit arbitrator in thesecond path. The destination-queues store narrow cells sent by a localtraffic sorter (from the first path) and the narrow cells translated bythe translator (from the second path. The local destination transmitarbitrator arbitrates an order in which narrow input cells stored in thedestination queues is sent to serializer transmitters. Finally, theserializer transmitters then that transmits the narrow input cells tocorresponding IBTs and/or source packet processors (and ultimately outof a blade through physical ports).

According to a further feature of the present invention, system andmethod for encoding wide striped cells is provided. The wide cellsextend across multiple stripes and include in-band control informationin each stripe. State information, reserved information, and payloaddata may also be included in each stripe. In one embodiment, a wide cellgenerator encodes one or more new wide striped cells.

The wide cell generator encodes an initial block of a start wide stripedcell with initial cell encoding information. The initial cell encodinginformation includes control information (such as, a special K0character) and state information provided in each subblock of an initialblock of a wide cell. The wide cell generator further distributesinitial bytes of packet data into available space in the initial block.Remaining bytes of packet data are distributed across one or more blocksin of the first wide striped cell (and subsequent wide cells) until anend of packet condition is reached or a maximum cell size is reached.Finally, the wide cell generator further encodes an end wide stripedcell with end of packet information that varies depending upon thedegree to which data has filled a wide striped cell. In one encodingscheme, the end of packet information varies depending upon a set of endof packet conditions including whether the end of packet occurs at theend of an initial block, within a subsequent block after the initialblock, at a block boundary, or at a cell boundary.

According to a further embodiment of the present invention, a method forinterfacing serial pipes carrying packets of data in narrow input cellsand a serial pipe carrying packets of data in wide striped cellsincludes receiving narrow input cells, generating wide striped cells,and transmitting blocks of the wide striped cells across multiplestripes. The method can also include sorting the received narrow inputcells based on a destination slot identifier, storing the generated widestriped cells in corresponding stripe send queues based on a destinationslot identifier and an originating source packet processor, andarbitrating the order in which the stored wide striped cells areselected for transmission.

In one example, the generating step includes parsing each narrow inputcell, checking for control information that indicates a start of packet,encoding one or more new wide striped cells until data from all narrowinput cells carrying the packet is distributed into the one or more newwide striped cells, and writing the one or more new wide striped cellsinto a plurality of send queues. The encoding step includes encoding aninitial block of a start wide striped cell with initial cell encodinginformation, such as, control information and state information.Encoding can further include distributing initial bytes of packet datainto available space in an initial block of a first wide striped cell,adding reserve information to available bytes at the end of the initialblock of the first wide striped cell, distributing remaining bytes ofpacket data across one or more blocks in the first wide striped celluntil an end of packet condition is reached or a maximum cell size isreached, and encoding an end wide striped cell with end of packetinformation. The end of packet information varies depending upon a setof end of packet conditions including whether the end of packet occursat the end of an initial block, in any block after the initial block, ata block boundary, or at a cell boundary.

The method also includes receiving wide striped cells carrying packetsof data in multiple stripes from a switching fabric, translating thereceived wide striped cells to narrow input cells carrying the packetsof data, and transmitting the narrow input cells to corresponding sourcepacket processors. The method further includes sorting the receivedsubblocks in each stripe based on originating slot identifierinformation, storing the sorted received subblocks in stripe receivesynchronization queues, and arbitrating an order in which data stored inthe stripe receive synchronization queues is assembled. Additional stepsare assembling wide striped cells in the order of the arbitrating stepbased on the received subblocks of data, translating the arbitratedreceived wide striped cells to narrow input cells carrying the packetsof data, and storing narrow cells in a plurality of destination queues.In one embodiment, further arbitration is performed includingarbitrating an order in which data stored in the destination queues isto be transmitted and transmitting the narrow input cells in the orderof the further arbitrating step to corresponding source packetprocessors and/or IBTs.

Further embodiments, features, and advantages of the present inventions,as well as the structure and operation of the various embodiments of thepresent invention, are described in detail below with reference to theaccompanying drawings.

BRIEF DESCRIPTION OF THE FIGURES

The accompanying drawings, which are incorporated herein and form a partof the specification, illustrate the present invention and, togetherwith the description, further serve to explain the principles of theinvention and to enable a person skilled in the pertinent art to makeand use the invention.

In the drawings:

FIG. 1 is a diagram of a high-performance network switch according to anembodiment of the present invention.

FIG. 2 is a diagram of a high-performance network switch showing aswitching fabric having cross point switches coupled to blades accordingto an embodiment of the present invention.

FIG. 3A is a diagram of blade used in the high-performance networkswitch of FIG. 1 according to an embodiment of the present invention.

FIG. 3B shows a configuration of blade according another embodiment ofthe present invention.

FIG. 4 is a diagram of the architecture of a cross point switch withport slices according to an embodiment of the present invention.

FIG. 5 is a diagram of the architecture of a port slice according to anembodiment of the present invention.

FIG. 6 is a diagram of a backplane interface adapter according to anembodiment of the present invention.

FIG. 7 is a diagram showing a traffic processing path for local serialtraffic received at a backplane interface adapter according to anembodiment of the present invention.

FIG. 8 is a diagram of an example switching fabric coupled to abackplane interface adapter according to an embodiment of the presentinvention.

FIG. 9 is a diagram showing a traffic processing path for backplaneserial traffic received at the backplane interface adapter according toan embodiment of the present invention.

FIG. 10 is a flowchart of operational steps carried out along a trafficprocessing path for local serial traffic received at a backplaneinterface adapter according to an embodiment of the present invention.

FIG. 11 is a flowchart of operational steps carried out along a trafficprocessing path for backplane serial traffic received at the backplaneinterface adapter according to an embodiment of the present invention.

FIG. 12 is a flowchart of a routine for generating wide striped cellsaccording to an embodiment of the present invention.

FIG. 13 is a diagram illustrating a narrow cell and state informationused in the narrow cell according to an embodiment of the presentinvention.

FIG. 14 is a flowchart of a routine for encoding wide striped cellsaccording to an embodiment of the present invention.

FIG. 15A is a diagram illustrating encoding in a wide striped cellaccording to an embodiment of the present invention.

FIG. 15B is a diagram illustrating state information used in a widestriped cell according to an embodiment of the present invention.

FIG. 15C is a diagram illustrating end of packet encoding informationused in a wide striped cell according to an embodiment of the presentinvention.

FIG. 15D is a diagram illustrating an example of a cell boundaryalignment condition during the transmission of wide striped cells inmultiple stripes according to an embodiment of the present invention.

FIG. 16 is a diagram illustrating an example of a packet alignmentcondition during the transmission of wide striped cells in multiplestripes according to an embodiment of the present invention.

FIG. 17 illustrates a block diagram of a bus translator according to oneembodiment of the present invention.

FIG. 18 illustrates a block diagram of the reception componentsaccording to one embodiment of the present invention.

FIG. 19 illustrates a block diagram of the transmission componentsaccording to one embodiment of the present invention.

FIG. 20 illustrates a detailed block diagram of the bus translatoraccording to one embodiment of the present invention.

FIG. 21A illustrates a detailed block diagram of the bus translatoraccording to another embodiment of the present invention.

FIG. 21B shows a functional block diagram of the data paths withreception components of the bus translator according to one embodimentof the present invention.

FIG. 21C shows a functional block diagram of the data paths withtransmission components of the bus translator according to oneembodiment of the present invention.

FIG. 21D shows a functional block diagram of the data paths with nativemode reception components of the bus translator according to oneembodiment of the present invention.

FIG. 21E shows a block diagram of a cell format according to oneembodiment of the present invention.

FIG. 22 illustrates a flow diagram of the encoding process of the bustranslator according to one embodiment of the present invention.

FIGS. 23A–B illustrates a detailed flow diagram of the encoding processof the bus translator according to one embodiment of the presentinvention.

FIG. 24 illustrates a flow diagram of the decoding process of the bustranslator according to one embodiment of the present invention.

FIGS. 25A–B illustrates a detailed flow diagram of the decoding processof the bus translator according to one embodiment of the presentinvention.

FIG. 26 illustrates a flow diagram of the administrating process of thebus translator according to one embodiment of the present invention.

FIGS. 27A–27E show a routine for processing data in port slice based onwide cell encoding and a flow control condition according to oneembodiment of the present invention.

The present invention will now be described with reference to theaccompanying drawings. In the drawings, like reference numbers indicateidentical or functionally similar elements. Additionally, the left-mostdigit(s) of a reference number identifies the drawing in which thereference number first appears.

DETAILED DESCRIPTION OF THE INVENTION Table of Contents

-   I. Overview and Discussion-   II. Terminology-   III. Digital Switch Architecture    -   A. Cross Point Architecture    -   B. Port Slice Operation with Wide Cell Encoding and Flow Control    -   C. Backplane Interface Adapter    -   D. Overall Operation of Backplane Interface Adapter    -   E. First Traffic Processing Path    -   F. Narrow Cell Format    -   G. Traffic Sorting    -   H. Wide Striped Cell Generation    -   I. Encoding Wide Striped Cells    -   J. Initial Block Encoding    -   K. End of Packet Encoding    -   L. Switching Fabric Transmit Arbitration    -   M. Cross Point Processing of Stripes    -   N. Second Traffic Processing Path    -   O. Cell Boundary Alignment    -   P. Packet Alignment    -   Q. Wide Striped Cell Size at Line Rate    -   R. IBT and Packet Processing    -   S. Narrow Cell and Packet Encoding Processes    -   T. Administrative Process and Error Control    -   U. Reset and Recovery Procedures-   IV. Control Logic-   V. Conclusion    I. Overview and Discussion

The present invention is a high-performance digital switch. Blades arecoupled through serial pipes to a switching fabric. Serial linktechnology is used in the switching fabric. Serial data streams, ratherthan parallel data streams, are switched through a loosely stripedswitching fabric. Blades output serial data streams in the serial pipes.A serial pipe can be a number of serial links coupling a blade to theswitching fabric. The serial data streams represent an aggregation ofinput serial data streams provided through physical ports to arespective blade. Each blade outputs serial data streams with in-bandcontrol information in multiple stripes to the switching fabric. In oneembodiment, the serial data streams carry packets of data in widestriped cells across multiple loosely-coupled stripes. Wide stripedcells are encoded. In-band control information is carried in one or moreblocks of a wide striped cell.

In one implementation, each blade of the switch is capable of sendingand receiving 50 gigabit per second full-duplex traffic across thebackplane. This is done to assure line rate, wire speed and non-blockingacross all packet sizes.

The high-performance switch according to the present invention can beused in any switching environment, including but not limited to, theInternet, an enterprise system, Internet service provider, and anyprotocol layer switching (such as, Layer 2, Layer 3, or Layers 4–7switching).

The present invention is described in terms of this example environment.Description in these terms is provided for convenience only. It is notintended that the invention be limited to application in these exampleenvironments. In fact, after reading the following description, it willbecome apparent to a person skilled in the relevant art how to implementthe invention in alternative environments known now or developed in thefuture.

II. Terminology

To more clearly delineate the present invention, an effort is madethroughout the specification to adhere to the following term definitionsas consistently as possible.

The terms “switch fabric” or “switching fabric” refer to a switchableinterconnection between blades. The switch fabric can be located on abackplane, a blade, more than one blade, a separate unit from theblades, or on any combination thereof.

The term “packet processor” refers to any type of packet processor,including but not limited to, an Ethernet packet processor. A packetprocessor parses and determines where to send packets.

The term “serial pipe” refers to one or more serial links. In oneembodiment, not intended to limit the invention, a serial pipe is a 10Gb/s serial pipe and includes four 2.5 Gb/s serial links.

The term “serial link” refers to a data link or bus carrying digitaldata serially between points. A serial link at a relatively high bitrate can also be made of a combination of lower bit rate serial links.

The term “stripe” refers to one data slice of a wide cell. The term“loosely-coupled” stripes refers to the data flow in stripes which isautonomous with respect to other stripes. Data flow is not limited tobeing fully synchronized in each of the stripes, rather, data flowproceeds independently in each of the stripes and can be skewed relativeto other stripes.

III. Digital Switch Architecture

An overview of the architecture of the switch 100 of the invention isillustrated in FIG. 1. Switch 100 includes a switch fabric 102 (alsocalled a switching fabric or switching fabric module) and a plurality ofblades 104. In one embodiment of the invention, switch 100 includes 8blades 104 a–104 h. Each blade 104 communicates with switch fabric 102via serial pipe 106. Each blade 104 further includes a plurality ofphysical ports 108 for receiving various types of digital data from oneor more network connections.

In a preferred embodiment of the invention, switch 100 having 8 bladesis capable of switching of 400 gigabits per second (Gb/s) full-duplextraffic. As used herein, all data rates are full-duplex unless indicatedotherwise. Each blade 104 communicates data at a rate of 50 Gb/s overserial pipe 106.

Switch 100 is shown in further detail in FIG. 2. As illustrated, switchfabric 102 comprises five cross points 202. Data sent and receivedbetween each blade and switch fabric 102 is striped across the fivecross point chips 202A–202E. Each cross point 262A–202E then receivesone stripe or ⅕ of the data passing through switch fabric 102. Asdepicted in FIG. 2, each serial pipe 106 of a blade 104 is made up offive serial links 204. The five serial links 204 of each blade 104 arecoupled to the five corresponding cross points 202. In one example, eachof the serial links 204 is a 10G serial link, such as, a 10G serial linkmade up of 4–2.5 Gb/s serial links. In this way, serial link technologyis used to send data across the backplane 102.

Each cross point 202A–202E is an 8-port cross point. In one example,each cross point 2202A–E receives eight 10G streams of data. Each streamof data corresponds to a particular stripe. The stripe has data in awide-cell format which includes, among other things, a destination portnumber (also called a destination slot number) and special in-bandcontrol information. The in-band control information includes special Kcharacters, such as, a K0 character and K1 character. The K0 characterdelimits a start of new cell within a stripe. The K1 character delimitsan end of a packet within the stripe. Such encoding within each stripe,allows each cross point 202A–202E to operate autonomously orindependently of other cross points. In this way, the cross points202A–202E and their associated stripes are loosely-coupled.

In each cross point 202, there are a set of data structures, such asdata FIFOs (First in First out data structures). The data structuresstore data based on the source port and the destination port. In oneembodiment, for an 8-port cross point, 56 data FIFOs are used. Each dataFIFO stores data associated with a respective source port anddestination port. Packets coming to each source port are written to thedata FIFOs which correspond to a source port and a destination portassociated with the packets. The source port is associated with the port(and port slice) on which the packets are received. The destination portis associated with a destination port or slot number which is foundin-band in data sent in a stripe to a port.

In embodiments of the present invention, the switch size is defined asone cell and the cell size is defined to be either 8, 28, 48, 68, 88,108, 128, or 148 bytes. Each port (or port slice) receives and sendsserial data at a rate of 10 Gb/s from respective serial links. Eachcross point 202A–202E has a 160 Gb/s switching capacity (160 Gb/s=10Gb/s*8 ports*2 directions full-duplex). Such cell sizes, serial linkdata rate, and switching capacity are illustrative and not necessarilyintended to limit the present invention. Cross-point architecture andoperation is described further below.

In attempting to increase the throughput of switches, conventionalwisdom has been to increase the width of data buses to increase the“parallel processing” capabilities of the switch and to increase clockrates. Both approaches, however, have met with diminishing returns. Forexample, very wide data buses are constrained by the physicallimitations of circuit boards. Similarly, very high clock rates arelimited by characteristics of printed circuit boards. Going againstconventional wisdom, the inventors have discovered that significantincreases in switching bandwidth could be obtained using serial linktechnology in the backplane.

In the preferred embodiment, each serial pipe 106 is capable of carryingfull-duplex traffic at 50 Gb/s, and each serial link 204 is capable ofcarrying full-duplex traffic at 10 Gb/s. The result of this architectureis that each of the five cross points 202 combines five 10 gigabit persecond serial links to achieve a total data rate of 50 gigabits persecond for each serial pipe 106. Thus, the total switching capacityacross backplane 102 for eight blades is 50 gigabits per second timeseight times two (for duplex) or 800 gigabits per second. Such switchingcapacities have not been possible with conventional technology usingsynched parallel data buses in a switching fabric.

An advantage of such a switch having a 50 Gb/s serial pipe to backplane102 from a blade 104 is that each blade 104 can support across a rangeof packet sizes four 10 Gb/s Ethernet packet processors at line rate,four Optical Channel OC-192C at line rate, or support one OC-768C atline rate. The invention is not limited to these examples. Otherconfigurations and types of packet processors and can be used with theswitch of the present invention as would be apparent to a person skilledin the art given this description.

Referring now to FIG. 3A, the architecture of a blade 104 is shown infurther detail. Blade 104 comprises a backplane interface adapter (BIA)302 (also referred to as a “super backplane interface adapter” or SBIA),a plurality of Integrated Bus Translators (IBT) 304 and a plurality ofpacket processors 306. BIA 302 is responsible for striping the dataacross the five cross points 202 of backplane 102. In a preferredembodiment, BIA 302 is implemented as an application-specific circuit(ASIC). BIA 302 receives data from packet processors 306 through IBTs304 (or directly from compatible packet processors). BIA 302 may passthe data to backplane 102 or may perform local switching between thelocal ports on blade 104. In a preferred embodiment, BIA 302 is coupledto four serial links 308. Each serial link 308 is coupled to an IBT 304.

Each packet processor 306 includes one or more physical ports. Eachpacket processor 306 receives inbound packets from the one or morephysical ports, determines a destination of the inbound packet based oncontrol information, provides local switching for local packets destinedfor a physical port to which the packet processor is connected, formatspackets destined for a remote port to produce parallel data and switchesthe parallel data to an IBT 304. Each IBT 304 receives the parallel datafrom each packet processor 306. IBT 304 then converts the parallel datato at least one serial bit streams. IBT 304 provides the serial bitstream to BIA 302 via a pipe 308, described herein as one or more seriallinks. In a preferred embodiment, each pipe 308 is a 10 Gb/s XAUIinterface.

In the example illustrated in FIG. 3A, packet processors 306C and 306Dcomprise 24—ten or 100 megabit per second Ethernet ports, and two 1000megabit per second or 1 Gb/s Ethernet ports. Before the data isconverted, the input data packets are converted to 32-bit parallel dataclock data 133 MHz to achieve a four Gb/s data rate. The data is placedin cells (also called “narrow cells”) and each cell includes a headerwhich merges control signals in-band with the data stream. Packets areinterleaved to different destination slots every 32 by cell boundary.

Also in the example of FIG. 3A, IBT 304C is connected to packetprocessors 306C and 306D. In this example, IBT 304A is connected to apacket processor 306A. This may be, for example, a ten gigabit persecond OC-192 packet processor. In these examples, each IBT 304 willreceive as its input a 64-bit wide data stream clocked at 156.25 MHz.Each IBT 304 will then output a 10 gigabit per second serial data streamto BIA 302. According to one narrow cell format, each cell includes a 4byte header followed by 32 bytes of data. The 4 byte header takes onecycle on the four XAUI lanes. Each data byte is serialized onto one XAUIlane.

BIA 302 receives the output of IBTs 304A–304D. Thus, BIA 302 receives 4times 10 Gb/s of data. Or alternatively, 8 times 5 gigabit per second ofdata. BIA 302 runs at a clock speed of 156.25 MHz. With the addition ofmanagement overhead and striping, BIA 302 outputs 5 times 10 gigabit persecond data streams to the five cross points 202 in backplane 102.

BIA 302 receives the serial bit streams from IBTs 304, determines adestination of each inbound packet based on packet header information,provides local switching between local IBTs 304, formats data destinedfor a remote port, aggregates the serial bit streams from IBTs 304 andproduces an aggregate bit stream. The aggregated bit stream is thenstriped across the five cross points 202A–202E.

FIG. 3B shows a configuration of blade 104 according another embodimentof the present invention. In this configuration, BIA 302 receives outputon serial links from a 10 Gb/s packet processor 316A, IBT 304C, and anOptical Channel OC-192C packet processor 316B. IBT 304 is furthercoupled to packet processors 306C, 306D as described above. 10 Gb/spacket processor 316A outputs a serial data stream of narrow input cellscarrying packets of data to BIA 302 over serial link 318A. IBT 304Coutputs a serial data stream of narrow input cells carrying packets ofdata to BIA 302 over serial link 308C. Optical Channel OC-192C packetprocessor 316B outputs two serial data streams of narrow input cellscarrying packets of data to BIA 302 over two serial links 318B, 318C.

A. Cross Point Architecture

FIG. 4 illustrates the architecture of a cross point 202. Cross point202 includes eight ports 401A–401H coupled to eight port slices402A–402H. As illustrated, each port slice 402 is connected by a wire404 (or other connective media) to each of the other seven port slices402. Each port slice 402 is also coupled to through a port 401 arespective blade 104. To illustrate this, FIG. 4 shows connections forport 401F and port slice 402F (also referred to as port slice 5). Forexample, port 401F is coupled via serial link 410 to blade 104F. Seriallink 410 can be a 10G full-duplex serial link.

Port slice 402F is coupled to each of the seven other port slices402A–402E and 402G–402H through links 420–426. Links 420–426 route datareceived in the other port slices 402A–402E and 402G–402H which has adestination port number (also called a destination slot number)associated with a port of port slice 402F (i.e. destination port number5). Finally, port slice 402F includes a link 430 that couples the portassociated with port slice 402F to the other seven port slices. Link 430allows data received at the port of port slice 402F to be sent to theother seven port slices. In one embodiment, each of the links 420–426and 430 between the port slices are buses to carry data in parallelwithin the cross point 202. Similar connections (not shown in theinterest of clarity) are also provided for each of the other port slices402A–402E, 402G and 402H.

FIG. 5 illustrates the architecture of port 401F and port slice 402F infurther detail. The architecture of the other ports 401A–401E, 401G, and4011H and port slices 402A–402E, 402G and 402H is similar to port 401Fand port slice 402F. Accordingly, only port 401F and port slice 402Fneed be described in detail. Port 401F includes one or more deserializerreceiver(s) 510 and serializer transmitter(s) 580. In one embodiment,deserializer receiver(s) 510 and serializer transmitter(s) 580 areimplemented as serializer/deserializer circuits (SERDES) that convertdata between serial and parallel data streams. In embodiments of theinvention, port 401F can be part of port slice 402F on a common chip, oron separate chips, or in separate units.

Port slice 402F includes a receive synch FIFO module 515 coupled betweendeserializer receiver(s) 510 and accumulator 520. Receive synch FIFOmodule 515 stores data output from deserializer receivers 510corresponding to port slice 402F. Accumulator 520 writes data to anappropriate data FIFO (not shown) in the other port slices 402A–402E,402G, and 402H based on a destination slot or port number in a header ofthe received data.

Port slice 402F also receives data from other port slices 402A–402E,402G, and 402H. This data corresponds to the data received at the otherseven ports of port slices 402A–402E, 402G, and 402H which has adestination slot number corresponding to port slice 402F. Port slice402F includes seven data FIFOs 530 to store data from corresponding portslices 402A–402E, 402G, and 402H. Accumulators (not shown) in the sevenport slices 402A–402E, 402G, and 402H extract the destination slotnumber associated with port slice 402F and write corresponding data torespective ones of seven data FIFOs 530 for port slice 402F. As shown inFIG. 5, each data FIFO 530 includes a FIFO controller and FIFO randomaccess memory (RAM). The FIFO controllers are coupled to a FIFO readarbitrator 540. FIFO RAMs are coupled to a multiplexer 550. FIFO readarbitrator 540 is further coupled to multiplexer 550. Multiplexer 550has an output coupled to dispatcher 560. Dispatch 560 has an outputcoupled to transmit synch FIFO module 570. Transmit synch FIFO module570 has an output coupled to serializer transmitter(s) 580.

During operation, the FIFO RAMs accumulate data. After a data FIFO RAMhas accumulated one cell of data, its corresponding FIFO controllergenerates a read request to FIFO read arbitrator 540. FIFO readarbitrator 540 processes read requests from the different FIFOcontrollers in a desired order, such as a round-robin order. After onecell of data is read from one FIFO RAM, FIFO read arbitrator 540 willmove on to process the next requesting FIFO controller. In this way,arbitration proceeds to serve different requesting FIFO controllers anddistribute the forwarding of data received at different source ports.This helps maintain a relatively even but loosely coupled flow of datathrough cross points 202.

To process a read request, FIFO read arbitrator 540 switches multiplexer550 to forward a cell of data from the data FIFO RAM associated with theread request to dispatcher 560. Dispatcher 560 outputs the data totransmit synch FIFO 570. Transmit synch FIFO 570 stores the data untilsent in a serial data stream by serializer transmitter(s) 580 to blade104F.

B. Port Slice Operation with Wide Cell Encoding and Flow Control

According to a further embodiment, a port slice operates with respect towide cell encoding and a flow control condition. FIGS. 27A–27E show aroutine 2700 for processing data in port slice based on wide cellencoding and a flow control condition (steps 2710–2790). In the interestof brevity, routine 2700 is described with respect to an exampleimplementation of cross point 202 and an example port slice 402F. Theoperation of the other port slices 402A–402E, 402G and 402H is similar.

In step 2710, entries in receive synch FIFO 515 are managed. In oneexample, receive synch FIFO module 515 is an 8-entry FIFO with writepointer and read pointer initialized to be 3 entries apart. Receivesynch FIFO module 515 writes 64-bit data from a SERDES deserializereceiver 510, reads 64-bit data from a FIFO with a clock signal anddelivers data to accumulator 520, and maintains a three entry separationbetween read/write pointers by adjusting the read pointer when theseparation becomes less than or equal to 1.

In step 2720, accumulator 520 receives two chunks of 32-bit data arereceived from receive synch FIFO 515. Accumulator 520 detects a specialcharacter K0 in the first bytes of first chunk and second chunk (step2722). Accumulator 520 then extracts a destination slot number from thestate field in the header if K0 is detected (step 2724).

As shown in FIG. 27B, accumulator 520 further determines whether thecell header is low-aligned or high-aligned (step 2726). Accumulator 520writes 64-bit data to the data FIFO corresponding to the destinationslot if cell header is either low-aligned or high-aligned, but not both(step 2728). In step 2730, accumulator 520 writes 2 64-bit data to 2data FIFOs corresponding to the two destination slots (or ports) if cellheaders appear in the first chunk and the second chunk of data(low-aligned and high-aligned). Accumulator 520 then fill the secondchunk of 32-bit data with idle characters when a cell does not terminateat the 64-bit boundary and the subsequent cell is destined for adifferent slot (step 2732). Accumulator 520 performs an earlytermination of a cell if an error condition is detected by inserting K0and ABORT state information in the data (step 2734). When accumulator520 detects a K1 character in the first byte of data_1(first chunk) anddata_h (second chunk) (step 2736), and accumulator 520 writes subsequent64-bit data to all destination data FIFOs (step 2738).

As shown in FIG. 27C, in step 2740, if two 32-bit chunks of data arevalid, then they are written to data FIFO RAM in one of data FIFOs 530.In step 2742, if only one of the 32-bit chunks is valid, it is saved ina temporary register if FIFO depth has not dropped below a predeterminedlevel. The saved 32-bit data and the subsequent valid 32-bit data arecombined and written to the FIFO RAM. If only one of the 32-bit chunksis valid and the FIFO depth has dropped below 4 entries, the valid32-bit chunk is combined with 32-bit idle data and written to the FIFORAM (step 2744).

In step 2746, a respective FIFO controller indicates to FIFO readarbitrator 540 if K0 has been read or FIFO RAM is empty. This indicationis a read request for arbitration. In step 2748, a respective FIFOcontroller indicates to FIFO read arbitrator 540 whether K0 is alignedto the first 32-bit chunk or the second 32-bit chunk. When flow controlfrom an output port is detected (such as when a predetermined flowcontrol sequence of one or more characters is detected), FIFO controllerstops requesting the FIFO read arbitrator 540 after the current cell iscompletely read from the FIFO RAM (step 2750).

As shown in FIG. 27D, in step 2760, FIFO read arbitrator 540 arbitratesamong 7 requests from 7 FIFO controllers and switches at a cell (K0)boundary. If end of the current cell is 64-bit aligned, then FIFO readarbitrator 540 switches to the next requestor and delivers 64-bit datafrom FIFO RAM of the requesting FIFO controller to the dispatcher 560(step 2762). If end of current cell is 32-bit aligned, then FIFO readarbitrator 540 combines the lower 32-bit of the current data with thelower 32-bit of the data from the next requesting FIFO controller, anddelivers the combined 64-bit data to the dispatcher 560 (step 2764).Further, in step 2766, FIFO read arbitrator 540 indicates to thedispatcher 560 when all 7 FIFO RAMs are empty.

As shown in FIG. 27E, in step 2770, dispatcher 560 delivers 64-bit datato the SERDES synch FIFO module 570 and in turn to serializertransmitter(s) 580, if non-idle data is received from the FIFO readarbitrator 540. Dispatcher 560 injects a first alignment sequence to betransmitted to the SERDES synch FIFO module 570 and in turn totransmitter 580 when FIFO read arbitrator indicates that all 7 FIFO RAMsare empty (step 2772). Dispatcher 560 injects a second alignmentsequence to be transmitted to the SERDES synch FIFO module 570 and inturn to transmitter 580 when the programmable timer expires and theprevious cell has been completely transmitted (step 2774). Dispatcher560 indicates to the FIFO read arbitrator 540 to temporarily stopserving any requestor until the current pre-scheduled alignment sequencehas been completely transmitted (step 2776). Control ends (step 2790).

C. Backplane Interface Adapter

To describe the structure and operation of the backplane interfaceadapter reference is made to components shown in FIGS. 6–9. FIG. 6 is adiagram of a backplane interface adapter (BIA) 600 according to anembodiment of the present invention. BIA 600 includes two trafficprocessing paths 603, 604. FIG. 7 is a diagram showing a first trafficprocessing path 603 for local serial traffic received at BIA 600according to an embodiment of the present invention. FIG. 8 is a diagramshowing in more detail an example switching fabric 645 according to anembodiment of the present invention. FIG. 9 is a diagram showing asecond traffic processing path 604 for backplane serial traffic receivedat BIA 600 according to an embodiment of the present invention. Forconvenience, BIA 600 of FIG. 6 will also be described with reference toa more detailed embodiment of elements along paths 603, 604 as shown inFIGS. 7 and 9, and the example switching fabric 645 shown in FIG. 8. Theoperation of a backplane interface adapter will be further describedwith respect to routines and example diagrams related to a wide stripedcell encoding scheme as shown in FIGS. 11–16.

D. Overall Operation of Backplane Interface Adapter

FIG. 10 is a flowchart of a routine 1000 interfacing serial pipescarrying packets of data in narrow input cells and a serial pipecarrying packets of data in wide striped cells (steps 1010–1060).Routine 1000 includes receiving narrow input cells (step 1010), sortingthe received input cells based on a destination slot identifier(1020),generating wide striped cells (step 1030), storing the generated widestriped cells in corresponding stripe send queues based on a destinationslot identifier and an originating source packet processor (step 1040),arbitrating the order in which the stored wide striped cells areselected for transmission (step 1050) and transmitting data slicesrepresenting blocks of wide cells across multiple stripes (step 1060).For brevity, each of these steps is described further with respect tothe operation of the first traffic processing path in BIA 600 inembodiments of FIGS. 6 and 7 below.

FIG. 11 is a flowchart of a routine 1100 interfacing serial pipescarrying packets of data in wide striped cells to serial pipes carryingpackets of data in narrow input cells (steps 1110–1180). Routine 1100includes receiving wide striped cells carrying packets of data inmultiple stripes from a switching fabric (step 1110), sorting thereceived subblocks in each stripe based on source packet processoridentifier and originating slot identifier information (step 1120),storing the sorted received subblocks in stripe receive synchronizationqueues (step 1130), assembling wide striped cells in the order of thearbitrating step based on the received subblocks of data (step 1140),translating the received wide striped cells to narrow input cellscarrying the packets of data (step 1150), storing narrow cells in aplurality of destination queues (step 1160), arbitrating an order inwhich data stored in the stripe receive synchronization queues isassembled (1170), and transmitting the narrow output cells tocorresponding source packet processors (step 1180). In one additionalembodiment, further arbitration is performed including arbitrating anorder in which data stored in the destination queues is to betransmitted and transmitting the narrow input cells in the order of thefurther arbitrating step to corresponding source packet processorsand/or IBTs. For brevity, each of these steps is described further withrespect to the operation of the second traffic processing path in BIA600 in embodiments of FIGS. 6 and 7 below.

As shown in FIG. 6, traffic processing flow path 603 extends in trafficflow direction from local packet processors toward a switching fabric645. Traffic processing flow path 604 extends in traffic flow directionfrom the switching fabric 645 toward local packet processors. BIA 600includes deserializer receiver(s) 602, traffic sorter 610, wide cellgenerator(s) 620, stripe send queues 625, switching fabric transmitarbitrator 630 and sterilizer transmitter(s) 640 coupled along path 603.BIA 600 includes deserializer receiver(s) 650, stripe interfacemodule(s) 660, stripe receive synchronization queues 685, controller 670(including arbitrator 672, striped-based wide cell assemblers 674, andadministrative module 676), wide/cell translator 680, destination queues615, local destination transmit arbitrator 690, and sterilizertransmitter(s) 692 coupled along path 604.

E. First Traffic Processing Path

Deserializer receiver(s) 602 receive narrow input cells carrying packetsof data. These narrow input cells are output to deserializer receiver(s)602 from packet processors and/or from integrated bus translators (IBTs)coupled to packet processors. In one example, four deserializerreceivers 602 are coupled to four serial links (such as, links 308A–D,318A–C described above in FIGS. 3A–3B). As shown in the example of FIG.7, each deserialize receiver 602 includes a deserializer receiver 702coupled to a cross-clock domain synchronizer 703. For example, eachdeserializer receiver 702 coupled to a cross-clock domain synchronizer703 can be in turn a set of four SERDES deserializer receivers anddomain synchronizers carrying the bytes of data in the four lanes of thenarrow input cells. In one embodiment, each deserializer receiver 702can receive interleaved streams of data from two serial links coupled totwo sources. FIG. 7 shows one example where four deserializer receivers702 (q=4) are coupled to two sources (j=2) of a total of eight seriallinks (k=8). In one example, each deserializer receiver 702 receives acapacity of 10 Gb/s of serial data.

F. Narrow Cell Format

FIG. 13 shows the format of an example narrow cell 1300 used to carrypackets of data in the narrow input cells. Such a format can include,but is not limited to, a data cell format received from a XAUIinterface. Narrow cell 1300 includes four lanes (lanes 0–3). Each lane0–3 carries a byte of data on a serial link. The beginning of a cellincludes a header followed by payload data. The header includes one bytein lane 0 of control information, and one byte in lane 1 of stateinformation. One byte is reserved in each of lanes 2 and 3. Table 1310shows example state information which can be used. This stateinformation can include any combination of state information includingone or more of the following: a slot number, a payload state, and asource or destination packet processor identifier. The slot number is anencoded number, such as, 00, 01, etc. or other identifier (e.g.,alphanumeric or ASCII values) that identifies the blade (also called aslot) towards which the narrow cell is being sent. The payload state canbe any encoded number or other identifier that indicates a particularstate of data in the cell being sent, such as, reserved (meaning areserved cell with no data), SOP (meaning a start of packet cell), data(meaning a cell carrying payload data of a packet), and abort (meaning apacket transfer is being aborted).

G. Traffic Sorting

Traffic sorter 610 sorts received narrow input cells based on adestination slot identifier. Traffic sorter 610 routes narrow cellsdestined for the same blade as BIA 600 (also called local traffic) todestination queues 615. Narrow cells destined for other blades in aswitch across the switching fabric (also called global traffic) arerouted to wide cell generators 620.

FIG. 7 shows a further embodiment where traffic sorter 610 includes aglobal/traffic sorter 712 coupled to a backplane sorter 714.Global/traffic sorter 712 sorts received narrow input cells based on thedestination slot identifier. Traffic sorter 712 routes narrow cellsdestined for the same blade as BIA 600 to destination queues 615. Narrowcells destined for other blades in a switch across the switching fabric(also called global traffic or backplane traffic) are routed tobackplane traffic sorter 714. Backplane traffic sorter 714 further sortsreceived narrow input cells having destination slot identifiers thatidentify global destination slots into groups based on the destinationslot identifier. In this way, narrow cells are grouped by the bladetowards which they are traveling. Backplane traffic sorter 714 thenroutes the sorted groups of narrow input cells of the backplane trafficto corresponding wide cell generators 720. Each wide cell generator 720then processes a corresponding group of narrow input cells. Each groupof narrow input cells represents portions of packets sent from twocorresponding interleaved sources (=2) and destined for a respectiveblade. In one example, 56 wide cell generators 720 are coupled to theoutput of four backplane traffic sorters 714. The total of 56 wide cellgenerators 720 is given by 56=q*j*l−1, where j=2 sources, l=8 blades,and q=four serial input pipes and four deserializer receivers 702.

H. Wide Striped Cell Generation

Wide cell generators 620 generate wide striped cells. The wide stripedcells carry the packets of data received by BIA 600 in the narrow inputcells. The wide cells extend across multiple stripes and include in-bandcontrol information in each stripe. In the interest of brevity, theoperation of wide cell generators 620, 720 is further described withrespect to a routine 1200 in FIG. 12. Routine 1200 however is notintended to be limited to use in wide cell generator 620, 720 and may beused in other structure and applications.

FIG. 12 shows a routine 1200 for generating wide striped cell generationaccording to the present invention (steps 1210–1240). In one embodiment,each wide cell generator(s) 620, 720 perform steps 1210–1240. In step1210, wide cell generator 620, 720 parse each narrow input cell toidentify a header. When control information is found in a header, acheck is made to determine whether the control information indicates astart of packet (step 1220). For example, to carry out steps 1210 and1220, wide cell generator 620, 720 can read lane 0 of narrow cell 1300to determine control information indicating a start of packet ispresent. In one example, this start of packet control information is aspecial control character K0.

For each detected packet (step 1225), steps 1230–1240 are performed. Instep 1230, wide cell generator 620, 720 encodes one or more new widestriped cells until data from all narrow input cells of the packet isdistributed into the one or more new wide striped cells. This encodingis further described below with respect to routine 1400 and FIGS. 15A–D,and 16.

In step 1230, wide cell generator 620 then writes the one or more newwide striped cells into a plurality of send queues 625. In the exampleof FIG. 7, a total of 56 wide cell generators 720 are coupled to 56stripes send queues 725. In this example, the 56 wide cell generators720 each write newly generated wide striped cells into respective onesof the 56 stripe send queues 725.

I. Encoding Wide Striped Cells

According to a further feature of the present invention, system andmethod for encoding wide striped cells is provided. In one embodiment,wide cell generators 620, 720 each generate wide striped cells which areencoded (step 1230). FIG. 14 is a flowchart of a routine 1400 forencoding wide striped cells according to an embodiment of the presentinvention (steps 1410–1460).

J. Initial Block Encoding

In step 1410, wide cell generator 620, 720 encodes an initial block of astart wide striped cell with initial cell encoding information. Theinitial cell encoding information includes control information (such as,a special K0 character) and state information provided in each subblockof an initial block of a wide striped cell. FIG. 15A shows the encodingof an initial block in a wide striped cell 1500 according to anembodiment of the present invention. The initial block is labeled ascycle 1. The initial block has twenty bytes that extend across fivestripes 1–5. Each stripe has a subblock of four bytes. The four bytes ofa subblock correspond to four one byte lanes. In this way, a stripe is adata slice of a subblock of a wide cell. A lane is a data slice of onebyte of the subblock. In step 1410, then control information (K0) isprovided all each lane 0 of the stripes 1–5. State information isprovided in each in each lane 1 of the stripes 1–5. Also, two bytes arereserved in lanes 2 and 3 of stripe 5.

FIG. 15B is a diagram illustrating state information used in a widestriped cell according to an embodiment of the present invention. Asshown in FIG. 15B, state information for a wide striped cell can includeany combination of state information including one or more of thefollowing: a slot number, a payload state, and reserved bits. The slotnumber is an encoded number, such as, 00, 01, etc. or other identifier(e.g., alphanumeric or ASCII values) that identifies the blade (alsocalled a slot) towards which the wide striped cell is being sent. Thepayload state can be any encoded number or other identifier thatindicates a particular state of data in the cell being sent, such as,reserved (meaning a reserved cell with no data), SOP (meaning a start ofpacket cell), data (meaning a cell carrying payload data of a packet),and abort (meaning a packet transfer is being aborted). Reserved bitsare also provided.

In step 1420, wide cell generator(s) 620, 720 distribute initial bytesof packet data into available space in the initial block. In the examplewide striped cell 1500 shown in FIG. 15A, two bytes of data D0, D1 areprovided in lanes 2 and 3 of stripe 1, two bytes of data D2, D3 areprovided in lanes 2 and 3 of stripe 2, two bytes of data D4, D5 areprovided in lanes 2 and 3 of stripe 3, and two bytes of data D6, D7 areprovided in lanes 2 and 3 of stripe 4.

In step 1430, wide cell generator(s) 620, 720 distribute remaining bytesof packet data across one or more blocks in of the first wide stripedcell (and subsequent wide cells). In the example wide striped cell 1500,maximum size of a wide striped cell is 160 bytes (8 blocks) whichcorresponds to a maximum of 148 bytes of data. In addition to the databytes D0–D7 in the initial block, wide striped cell 1500 further hasdata bytes D8–D147 distributed in seven blocks (labeled in FIG. 15A asblocks 2–8).

In general, packet data continues to be distributed until an end ofpacket condition is reached or a maximum cell size is reached.Accordingly, checks are made of whether a maximum cell size is reached(step 1440) and whether the end of packet is reached (step 1450). If themaximum cell size is reached in step 1440 and more packet data needs tobe distributed then control returns to step 1410 to create additionalwide striped cells to carry the rest of the packet data. If the maximumcell size is not reached in step 1440, then an end of packet check ismade (step 1450). If an end of packet is reached then the current widestriped cell being filled with packet data is the end wide striped cell.Note for small packets less than 148 bytes, than only one wide stripedcell is needed. Otherwise, more than one wide striped cells are used tocarry a packet of data across multiple stripes. When an end of packet isreached in step 1450, then control proceeds to step 1460.

K. End of Packet Encoding

In step 1460, wide cell generator(s) 620, 720 further encode an end widestriped cell with end of packet information that varies depending uponthe degree to which data has filled a wide striped cell. In one encodingscheme, the end of packet information varies depending upon a set of endof packet conditions including whether the end of packet occurs in aninitial cycle or subsequent cycles, at a block boundary, or at a cellboundary.

FIG. 15C is a diagram illustrating end of packet encoding informationused in an end wide striped cell according to an embodiment of thepresent invention. A special character byte K1 is used to indicate endof packet. A set of four end of packet conditions are shown (items 1–4).The four end of packet conditions are whether the end of packet occursduring the initial block (item 1) or during any subsequent block (items2–4). The end of packet conditions for subsequent blocks further includewhether the end of packet occurs within a block (item 2), at a blockboundary (item 3), or at a cell boundary (item 4). As shown in item 1 ofFIG. 15C, when the end of packet occurs during the initial block,control and state information (K0, state) and reserved information arepreserved as in any other initial block transmission. K1 bytes are addedas data in remaining data bytes.

As shown in item 2 of FIG. 15C, when the end of packet occurs during asubsequent block (and not at a block or cell boundary), K1 bytes areadded as data in remaining data bytes until an end of a block isreached. In FIG. 15C, item 2, an end of packet is reached at data byteD33 (stripe 2, lane 1 in block of cycle 3). K1 bytes are added for eachlane for remainder of block. When the end of packet occurs at a blockboundary of a subsequent block (item 3), K1 bytes are added as data inan entire subsequent block. In FIG. 15C, item 3, an end of packet isreached at data byte D27 (end of block of block 2). K1 bytes are addedfor each lane for entire block (block 3). When the end of packet occursduring a subsequent block but at a cell boundary (item 4), one widestriped cell having an initial block with K1 bytes added as data isgenerated. In FIG. 15D, item 4, an end of packet is reached at data byteD147 (end of cell and end of block for block 8). One wide striped cellconsisting of only an initial block with normal control, state andreserved information and with K1 bytes added as data is generated. Asshown in FIG. 15D, such an initial block with K1 bytes consists ofstripes 1–5 with bytes as follows: stripe 1 (K0, state, K1,K1), stripe 2(K0, state, K1,K1), stripe 3 (K0, state, K1,K1), stripe 4 (K0, state,K1,K1), stripe 5 (K0, state, reserved, reserved).

L. Switching Fabric Transmit Arbitration

In one embodiment, BIA 600 also includes switching fabric transmitarbitrator 630. Switching fabric transmit arbitrator 630 arbitrates theorder in which data stored in the stripe send queues 625, 725 is sent bytransmitters 640, 740 to the switching fabric. Each stripe send queue625, 725 stores a respective group of wide striped cells correspondingto a respective originating source packet processor and a destinationslot identifier. Each wide striped cell has one or more blocks acrossmultiple stripes. During operation the switching fabric transmitarbitrator 630 selects a stripe send queue 625, 725 and pushes the nextavailable cell to the transmitters 640, 740. In this way one full cellis sent at a time. (Alternatively, a portion of a cell can be sent.)Each stripe of a wide cell is pushed to the respective transmitter 640,740 for that stripe. In one example, during normal operation, a completepacket is sent to any particular slot or blade from a particular packetprocessor before a new packet is sent to that slot from different packetprocessors. However, the packets for the different slots are sent duringan arbitration cycle. In an alternative embodiment, other blades orslots are then selected in a round-robin fashion.

M. Cross Point Processing of Stripes including Wide Cell Encoding

In on embodiment, switching fabric 645 includes a number n of crosspoint switches 202 corresponding to each of the stripes. Each crosspoint switch 202 (also referred to herein as a cross point or crosspoint chip) handles one data slice of wide cells corresponding to onerespective stripe. In one example, five cross point switches 202A–202Eare provided corresponding to five stripes. For clarity, FIG. 8 showsonly two of five cross point switches corresponding to stripes 1 and 5.The five cross point switches 202 are coupled between transmitters andreceivers of all of the blades of a switch as described above withrespect to FIG. 2. For example, FIG. 8 shows cross point switches 202coupled between one set of transmitters 740 for stripes of one blade andanother set of receivers 850 on a different blade.

The operation of a cross point 202 and in particular a port slice 402Fis now described with respect to an embodiment where stripes furtherinclude wide cell encoding and a flow control indication.

Port slice 402F also receives data from other port slices 402A–402E,402G, and 402H. This data corresponds to the data received at the otherseven ports of port slices 402A–402E, 402G, and 402H which has adestination slot number corresponding to port slice 402F. Port slice402F includes seven data FIFOs 530 to store data from corresponding portslices 402A–402E, 402G, and 402H. Accumulators (not shown) in the sevenport slices 402A–402E, 402G, and 402H extract the destination slotnumber associated with port slice 402F and write corresponding data torespective ones of seven data FIFOs 530 for port slice 402F. As shown inFIG. 5, each data FIFO 530 includes a FIFO controller and FIFO randomaccess memory (RAM). The FIFO controllers are coupled to a FIFO readarbitrator 540. FIFO RAMs are coupled to a multiplexer 550. FIFO readarbitrator 540 is further coupled to multiplexer 550. Multiplexer 550has an output coupled to dispatcher 560. Dispatch 560 has an outputcoupled to transmit synch FIFO module 570. Transmit synch FIFO module570 has an output coupled to serializer transmitter(s) 580.

During operation, the FIFO RAMs accumulate data. After a data FIFO RAMhas accumulated one cell of data, its corresponding FIFO controllergenerates a read request to FIFO read arbitrator 540. FIFO readarbitrator 540 processes read requests from the different FIFOcontrollers in a desired order, such as a round-robin order. After onecell of data is read from one FIFO RAM, FIFO read arbitrator 540 willmove on to process the next requesting FIFO controller. In this way,arbitration proceeds to serve different requesting FIFO controllers anddistribute the forwarding of data received at different source ports.This helps maintain a relatively even but loosely coupled flow of datathrough cross points 202.

To process a read request, FIFO read arbitrator 540 switches multiplexer550 to forward a cell of data from the data FIFO RAM associated with theread request to dispatcher 560. Dispatcher 560 outputs the data totransmit synch FIFO 570. Transmit synch FIFO 570 stores the data untilsent in a serial data stream by serializer transmitter(s) 580 to blade104F.

Cross point operation according to the present invention is describedfurther below with respect to a further embodiment involving wide cellencoding and flow control.

N. Second Traffic Processing Path

FIG. 6 also shows a traffic processing path for backplane serial trafficreceived at backplane interface adapter 600 according to an embodimentof the present invention. FIG. 9 further shows the second trafficprocessing path in even more detail.

As shown in FIG. 6, BIA 600 includes one or more deserialize receivers650, wide/narrow cell translators 680, and serializer transmitters 692along the second path. Receivers 650 receive wide striped cells inmultiple stripes from the switching fabric 645. The wide striped cellscarry packets of data. In one example, five deserializer receivers 650receive five subblocks of wide striped cells in multiple stripes. Thewide striped cells carrying packets of data across the multiple stripesand including originating slot identifier information. In one digitalswitch embodiment, originating slot identifier information is written inthe wide striped cells as they pass through cross points in theswitching fabric as described above with respect to FIG. 8.

Translators 680 translate the received wide striped cells to narrowinput cells carrying the packets of data. Serializer transmitters 692transmit the narrow input cells to corresponding source packetprocessors or IBTs.

BIA 600 further includes stripe interfaces 660 (also called stripeinterface modules), stripe receive synchronization queues (685), andcontroller 670 coupled between deserializer receivers 650 and acontroller 670. Each stripe interface 660 sorts received subblocks ineach stripe based on source packet processor identifier and originatingslot identifier information and stores the sorted received subblocks inthe stripe receive synchronization queues 685.

Controller 670 includes an arbitrator 672, a striped-based wide cellassembler 674, and an administrative module 676. Arbitrator 672arbitrates an order in which data stored in stripe receivesynchronization queues 685 is sent to striped-based wide cell assembler674. Striped-based wide cell assembler 674 assembles wide striped cellsbased on the received subblocks of data. A narrow/wide cell translator680 then translates the arbitrated received wide striped cells to narrowinput cells carrying the packets of data. Administrative module 676 isprovided to carry out flow control, queue threshold level detection, anderror detection (such as, stripe synchronization error detection), orother desired management or administrative functionality.

A second level of arbitration is also provided according to anembodiment of the present invention. BIA 600 further includesdestination queues 615 and a local destination transmit arbitrator 690in the second path. Destination queues 615 store narrow cells sent bytraffic sorter 610 (from the first path) and the narrow cells translatedby the translator 680 (from the second path). Local destination transmitarbitrator 690 arbitrates an order in which narrow input cells stored indestination queues 690 is sent to serializer transmitters 692. Finally,serializer transmitters 692 then transmit the narrow input cells tocorresponding IBTs and/or source packet processors (and ultimately outof a blade through physical ports).

FIG. 9 further shows the second traffic processing path in even moredetail. BIA 600 includes five groups of components for processing dataslices from five slices. In FIG. 9 only two groups 900 and 901 are shownfor clarity, and only group 900 need be described in detail with respectto one stripe since the operations of the other groups is similar forthe other four stripes.

In the second traffic path, deserializer receiver 950 is coupled tocross clock domain synchronizer 952. Deserializer receiver 950 convertsserial data slices of a stripe (e.g., subblocks) to parallel data. Crossclock domain synchronizer 952 synchronizes the parallel data.

Stripe interface 960 has a decoder 962 and sorter 964 to decode and sortreceived subblocks in each stripe based on source packet processoridentifier and originating slot identifier information. Sorter 964 thenstores the sorted received subblocks in stripe receive synchronizationqueues 965. Five groups of 56 stripe receive synchronization queues 965are provided in total. This allows one queue to be dedicated for eachgroup of subblocks received from a particular source per global blade(up to 8 source packet processors per blade for seven blades notincluding the current blade).

Arbitrator 672 arbitrates an order in which data stored in stripereceive synchronization queues 685 sent to striped-based wide cellassembler 674. Striped-based wide cell assembler 674 assembles widestriped cells based on the received subblocks of data. A narrow/widecell translator 680 then translates the arbitrated received wide stripedcells to narrow input cells carrying the packets of data as describedabove in FIG. 6.

Destination queues include local destination queues 982 and backplanetraffic queues 984. Local destination queues 982 store narrow cells sentby local traffic sorter 716. Backplane traffic queues 984 store narrowcells translated by the translator 680. Local destination transmitarbitrator 690 arbitrates an order in which narrow input cells stored indestination queues 982, 984 is sent to serializer transmitters 992.Finally, serializer transmitters 992 then transmit the narrow inputcells to corresponding IBTs and/or source packet processors (andultimately out of a blade through physical ports).

O. Cell Boundary Alignment

FIG. 15D is a diagram illustrating an example of a cell boundaryalignment condition during the transmission of wide striped cells inmultiple stripes according to an embodiment of the present invention. AK0 character is guaranteed by the encoding and wide striped cellgeneration to be present every 8 blocks for any given stripe. Cellboundaries among the stripes themselves can be out of alignment. Thisout of alignment however is compensated for and handled by the secondtraffic processing flow path in BIA 600.

P. Packet Alignment

FIG. 16 is a diagram illustrating an example of a packet alignmentcondition during the transmission of wide striped cells in multiplestripes according to an embodiment of the present invention. Cell canvary between stripes but all stripes are essentially transmitting thesame packet or nearby packets. Since each cross point arbitrates amongits sources independently, not only can there be a skew in a cellboundary, but there can be as many as seven cell time units (time totransmit cells) of skew between a transmission of a packet on one seriallink verus its transmission on any other link. This also means thatpackets may be interlaced with other packets in the transmission inmultiple stripes over the switching fabric.

Q. Wide Striped Cell Size at Line Rate

In one example, a wide cell has a maximum size of eight blocks (160bytes) which can carry a 148 bytes of payload data and 12 bytes ofin-band control information. Packets of data for full-duplex traffic canbe carried in the wide cells at a 50 Gb/sec rate through the digitalswitch.

R. IBT and Packet Processing

The integrated packet controller (IPC) and integrated giga controller(IGC) functions are provided with a bus translator, described above asthe IPC/IGC Bus Translator (IBT) 304. In one embodiment, the IBT is anASIC that bridges one or more IPC/IC ASIC. In such an embodiment, theIBT translates two 4/5 gig parallel stream into one 10 Gbps serialstream. The parallel interface can be the backplane interface of theIPC/IGC ASICs. The one 10 Gbps serial stream can be further processed,for example, as described herein with regard to interface adapters andstriping.

Additionally, IBT 304 can be configured to operate with otherarchitectures as would be apparent to one skilled in the relevant art(s)based at least on the teachings herein. For example, the IBT 304 can beimplemented in packet processors using 10 GE and OC-192 configurations.The functionality of the IBT 304 can be incorporated within existingpacket processors or attached as an add-on component to a system.

In FIG. 17, a block diagram 1700 illustrates the components of a bustranslator 1702 according to one embodiment of the present invention.The previously described IBT 304 can be configured as the bus translator1702 of FIG. 17. For example, IBT 304 can be implemented to include thefunctionality of the bus translator 1702.

More specifically, the bus translator 1702 translates data 1704 intodata 1706 and data 1706 into data 104. The data 1706 is received bytransceiver(s) 1710 is forwarded to a translator 1712. The translator1712 parses and encodes the data 1706 into a desired format.

Here, the translator 1712 translates the data 1706 into the format ofthe data 1704. The translator 1712 is managed by an administrationmodule 1718. One or more memory pools 1716 store the information of thedata 1706 and the data 1704. One or more clocks 1714 provide the timinginformation to the translation operations of the translator 1712. Oncethe translator 1712 finishes translating the data 1706, it forwards thenewly formatted information as the data 1704 to the transceiver(s) 1708.The transceiver(s) 1708 forward the data 1704.

As one skilled in the relevant art would recognize based on theteachings described herein, the operational direction of bus translator1702 can be reversed and the data 1704 received by the bus translator1702 and the data 1706 forwarded after translation.

For ease of illustration, but without limitation, the process oftranslating the data 1706 into the data 1704 is herein described asreceiving, reception, and the like. Additionally, for ease ofillustration, but without limitation, the process of translating thedata 1704 into the data 1706 is herein described as transmitting,transmission, and the like.

In FIG. 18, a block diagram of the reception components according to oneembodiment of the present invention. In one embodiment, bus translator1802 receives data in the form of packets from interface connections1804 a–n. The interface connections 1804 a–n couple to one or morereceivers 1808 of bus translator 1802. Receivers 1808 forward thereceived packets to one or more packet decoders 1810. In one embodiment,the receiver(s) 1808 includes one or more physical ports. In anadditional embodiment, each of receivers 1808 includes one or morelogical ports. In one specific embodiment, the receiver(s) 1808 consistsof four logical ports.

The packet decoders 1810 receive the packets from the receivers 1808.The packet decoders 1810 parse the information from the packets. In oneembodiment, as is described below in additional detail, the packetdecoders 1810 copy the payload information from each packet as well asthe additional information about the packet, such as time and place oforigin, from the start of packet (SOP) and the end of packet (EOP)sections of the packet. The packet decoders 1810 forward the parsedinformation to memory pool(s) 1812. In one embodiment, the bustranslator 1802 includes more than one memory pool 1812. In analternative embodiment, alternate memory pool(s) 1818 can be sent theinformation. In an additional embodiment, the packet decoder(s) 1810 canforward different types of information, such as payload, time ofdelivery, origin, and the like, to different memory pools of the pools1812 and 1818.

Reference clock 1820 provides timing information to the packetdecoder(s) 1810. In one embodiment, reference clock 1820 is coupled tothe IPC/IGC components sending the packets through the connections 1804a–n. In another embodiment, the reference clock 1820 provides-referenceand timing information to all the parallel components of the bustranslator 1802.

Cell encoder(s) 1814 receives the information from the memory pool(s)1812. In an alternative embodiment, the cell encoder(s) 1814 receivesthe information from the alternative memory pool(s) 1818. The cellencoder(s) 1814 formats the information into cells.

In the description that follows, these cells are also referred to asnarrow cells. Furthermore, the cell encoder(s) 1814 can be configured toformat the information into one or more cell types. In one embodiment,the cell format is a fixed size. In another embodiment, the cell formatis a variable size.

The cell format is described in detail below with regard to cellencoding and decoding processes of FIGS. 22, 23A–B, 24, and 25A–B.

The cell encoder(s) 1814 forwards the cells to transmitter(s) 1816. Thetransmitter(s) 1816 receive the cells and transmit the cells throughinterface connections 1806 a–n.

Reference clock 1828 provides timing information to the cell encoder(s)1814. In one embodiment, reference clock 1828 is coupled to theinterface adapter components receiving the cells through the connections1806 a–n. In another embodiment, the reference clock 1828 providesreference and timing information to all the serial components of the bustranslator 1802.

Flow controller 1822 measures and controls the incoming packets andoutgoing cells by determining the status of the components of the bustranslator 1802 and the status of the components connected to the bustranslator 1802. Such components are previously described herein andadditional detail is provided with regard to the interface adapters ofthe present invention.

In one embodiment, the flow controller 1822 controls the traffic throughthe connection 1806 by asserting a ready signal and de-asserting theready signal in the event of an overflow in the bus translator 1802 orthe IPC/IGC components further connected.

Administration module 1824 provides control features for the bustranslator 1802. In one embodiment, the administration module 1824provides error control and power-on and reset functionality for the bustranslator 1802.

FIG. 19 illustrates a block diagram of the transmission componentsaccording to one embodiment of the present invention. In one embodiment,bus translator 1902 receives data in the form of cells from interfaceconnections 1904 a–n. The interface connections 1904 a–n couple to oneor more receivers 1908 of bus translator 1902. In one embodiment, thereceiver(s) 1908 include one or more physical ports. In an additionalembodiment, each of receivers 1908 includes one or more logical ports.In one specific embodiment, the receiver(s) 1908 consists of fourlogical ports. Receivers 1908 forward the received cells to asynchronization module 1910. In one embodiment, the synchronizationmodule 1910 is a FIFO used to synchronize incoming cells to thereference clock 1922. It is noted that although there is no direct arrowshown in FIG. 19 from reference clock 1922 to synchronization module1910, the two module can communicate such that the synchronizationmodule is capable of synchronizing the incoming cells. Thesynchronization module 1910 forwards the one or more cell decoders 1912.

The cell decoders 1912 receive the cells from the synchronization module1910. The cell decoders 1912 parse the information from the cells. Inone embodiment, as is described below in additional detail, the celldecoders 1912 copy the payload information from each cell as well as theadditional information about the cell, such as place of origin, from theslot and state information section of the cell.

In one embodiment, the cell format can be fixed. In another embodiment,the cell format can be variable. In yet another embodiment, the cellsreceived by the bus translator 1902 can be of more than one cell format.The bus translator 1902 can be configured to decode these cell format asone skilled in the relevant art would recognize based on the teachingsherein. Further details regarding the cell formats is described belowwith regard to the cell encoding processes of the present invention.

The cell decoders 1912 forward the parsed information to memory pool(s)1914. In one embodiment, the bus translator 1902 includes more than onememory pool 1914. In an alternative embodiment, alternate memory pool(s)1916 can be sent the information. In an additional embodiment, the celldecoder(s) 1912 can forward different types of information, such aspayload, time of delivery, origin, and the like, to different memorypools of the pools 1914 and 1916.

Reference clock 1922 provides timing information to the cell decoder(s)1912. In one embodiment, reference clock 1922 is coupled to theinterface adapter components sending the cells through the connections1904 a–n. In another embodiment, the reference clock 1922 providesreference and timing information to all the serial components of the bustranslator 1902.

Packet encoder(s) 1918 receive the information from the memory pool(s)1914. In an alternative embodiment, the packet encoder(s) 1918 receivethe information from the alternative memory pool(s) 1916. The packetencoder(s) 1918 format the information into packets.

The packet format is determined by the configuration of the IPC/IGCcomponents and the requirements for the system.

The packet encoder(s) 1918 forwards the packets to transmitter(s) 1920.The transmitter(s) 1920 receive the packets and transmit the packetsthrough interface connections 1906 a–n.

Reference clock 1928, provides timing information to the packetencoder(s) 1918. In one embodiment, reference clock 1928 is coupled tothe IPC/IGC components receiving the packets through the connections1906 a–n. In another embodiment, the reference clock 1928 providesreference and timing information to all the parallel components of thebus translator 1902.

Flow controller 1926 measures and controls the incoming cells andoutgoing packets by determining the status of the components of the bustranslator 1902 and the status of the components connected to the bustranslator 1902. Such components are previously described herein andadditional detail is provided with regard to the interface adapters ofthe present invention.

In one embodiment, the flow controller 1926 controls the traffic throughthe connection 1906 by asserting a ready signal and de-asserting theready signal in the event of an overflow in the bus translator 1902 orthe IPC/IGC components further connected.

Administration module 1924 provides control features for the bustranslator 1902. In one embodiment, the administration module 1924provides error control and power-on and reset functionality for the bustranslator 1902.

In FIG. 20, a detailed block diagram of the bus translator according toone embodiment, is shown. Bus translator 2002 incorporates thefunctionality of bus translators 1802 and 1902.

In terms of packet processing, packets are received by the bustranslator 2002 by receivers 2012. The packets are processed into cellsand forwarded to a serializer/deserializer (SERDES) 2026. SERDES 2026acts as a transceiver for the cells being processed by the bustranslator 2002. The SERDES 2026 transmits the cells via interfaceconnection 2006.

In terms of cell processing, cells are received by the bus translator2002 through the interface connection 2008 to the SERDES 2026. The cellsare processed into packets and forwarded to transmitters 2036. Thetransmitters 2036 forward the packets to the IPC/IGC components throughinterface connections 2010 a–n.

The reference clocks 2040 and 2048 are similar to those previouslydescribed in FIGS. 18 and 19. The reference clock 2040 provides timinginformation to the serial components of the bus translator 2002. Asshown, the reference clock 2040 provides timing information to the cellencoder(s) 2020, cell decoder(s) 2030, and the SERDES 2026. Thereference clock 2048 provides timing information to the parallelcomponents of bus translator 2002. As shown, the reference clock 2048provides timing information to the packet decoder(s) 2016 and packetencoder(s) 2034.

The above-described separation of serial and parallel operations is afeature of embodiments of the present invention. In such embodiments,the parallel format of incoming and leaving packets at ports 2014 a–nand 2038 a–b, respectively, is remapped into a serial cell format at theSERDES 2026.

Furthermore, according to embodiments of the present invention, the linerates of the ports 2014 a–n have a shared utilization limited only bythe line rate of output 2006. Similarly for ports 2038 a–n and input2008.

The remapping of parallel packets into serial cells is described infurther detail herein, more specifically with regard to FIG. 21E.

In FIG. 21A, a detailed block diagram of the bus translator, accordingto another embodiment of the present invention, is shown. The receiversand transmitters of FIGS. 18, 19, and 20 are replaced with CMOS I/Os2112 capable of providing the same functionality as previouslydescribed. The CMOS I/Os 2112 can be configured to accommodate variousnumbers of physical and logical ports for the reception and transmissionof data.

Administration module 2140 operates as previously described. As shown,the administration module 2140 includes an administration controlelement and an administration register. The administration controlelement monitors the operation of the bus translator 2102 and providesthe reset and power-on functionality as previously described with regardto FIGS. 18, 19, and 20. The administration register caches operatingparameters such that the state of the bus translator 2102 can bedetermined based on a comparison or look-up against the cachedparameters.

The reference clocks 2134 and 2136 are similar to those previouslydescribed in FIGS. 18, 19, and 20. The reference clock 2136 providestiming information to the serial components of the bus translator 2102.As shown, the reference clock 2136 provides timing information to thecell encoder(s) 2118, cell decoder(s) 2128, and the SERDES 2124. Thereference clock 2134 provides timing information to the parallelcomponents of bus translator 2102. As shown, the reference clock 2134provides timing information to the packet decoder(s) 2114 and packetencoder(s) 2132.

As shown in FIG. 21A, memory pool 2116 includes two pairs of FIFOs. EachFIFO pair with a header queue. The memory pool 2116 performs aspreviously described memory pools in FIGS. 18 and 20. In one embodiment,payload or information portions of decoded packets is stored in one ormore FIFOs and the timing, place of origin, destination, and similarinformation is stored in the corresponding header queue.

Additionally, memory pool 2130 includes two pairs of FIFOs. The memorypool 2130 performs as previously described memory pools in FIGS. 19 and20. In one embodiment, decoded cell information is stored in one or moreFIFOs along with corresponding timing, place of origin, destination, andsimilar information.

Interface connections 2106 and 2108 connect previously describedinterface adapters to the bus translator 2102 through the SERDES 2124.In one embodiment, the connections 2106 and 2108 are serial links. Inanother embodiment, the serial links are divided four lanes.

In one embodiment, the bus translator 2102 is an IBT 304 that translatesone or more 4 Gbps parallel IPC/IGC components into four 3.125 Gbpsserial XAUI interface links or lanes. In one embodiment, the back planesare the IPC/IGC interface connections. The bus translator 2102 formatsincoming data into one or more cell formats.

In one embodiment, the cell format can be a four byte header and a 32byte data payload. In a further embodiment, each cell is separated by aspecial K character into the header. In another embodiment, the lastcell of a packet is indicated by one or more special K1 characters.

The cell formats can include both fixed length cells and variable lengthcells. The 36 bytes (4 byte header plus 32 byte payload) encoding is anexample of a fixed length cell format. In an alternative embodiment,cell formats can be implemented where the cell length exceeds the 36bytes (4 bytes+32 bytes) previously described.

In FIG. 21B, a functional block diagram shows the data paths withreception components of the bus translator. Packet decoders 2150 a–bforward packet data to the FIFOs and headers in pairs. For example,packet decoder 2150 a forwards packet data to FIFO 2152 a–b andside-band information to header 2154. A similar process is followed forpacket decoder 2150 b. Packet decoder 2150 b forwards packet data toFIFO 2156 a–b and side-band information to header 2158. Cell encoder(s)2160 receive the data and control information and produce cells toserializer/deserializer (SERDES) circuits, shown as their functionalcomponents SERDES special character 2162, and SERDES data 2164 a–b. TheSERDES special character 2162 contains the special characters used toindicate the start and end of a cell's data payload. The SERDES data2164 a–b contains the data payload for each cell, as well as the controlinformation for the cell. Cell structure is described in additionaldetail below, with respect to FIG. 21E.

The bus translator 2102 has memory pools 2116 to act as internal databuffers to handle pipeline latency. For each IPC/IGC component, the bustranslator 2102 has two data FIFOs and one header FIFO, as shown in FIG.21A as the FIFOs of memory pool 2116 and in FIG. 21B as elements 2152a–b, 2154, 2156 a–b, and 2158. In one embodiment, side band informationis stored in each of the headers A or B. 32 bytes of data is stored inone or more of the two data FIFOs A1, A2, or B1, B2 in a ping-pongfashion. The ping-pong fashion is well-known in the relevant art andinvolves alternating fashion.

In one embodiment, the cell encoder 2160 merges the data from each ofthe packet decoders 2150 a–b into one 10 Gbps data stream to theinterface adapter. The cell encoder 2160 merges the data by interleavingthe data at each cell boundary. Each cell boundary is determined by thespecial K characters.

According to one embodiment, the received packets are 32 bit aligned,while the parallel interface of the SERDES elements is 64 bit wide.

In practice it can be difficult to achieve line rate for any packetlength. Line rate means maintaining the same rate of output in cells asthe rate at which packets are being received. Packets can have a fourbyte header overhead (SOP) and a four byte tail overhead (EOP).Therefore, the bus translators 2102 must parse the packets without thedelays of typical parsing and routing components. More specifically, thebus translators 2102 formats parallel data inot cell format usingspecial K characters, as described in more detail below, to merge stateinformation and slot information (together, control information) in bandwith the data streams. Thus, in one embodiment, each 32 bytes of celldata is accompanied by a four byte header.

FIG. 21C shows a functional block diagram of the data paths withtransmission components of the bus translator according to oneembodiment of the present invention. Cell decoder(s) 2174 receive cellsfrom the SERDES circuit. The functional components of the SERDES circuitinclude elements 2170, and 2172 a–b. The control information and dataare parsed from the cell and forward to the memory pool(s). In oneembodiment, FIFOs are maintained in pairs, shown as elements 2176 a–band 2176 c–d. Each pair forwards control information and data to packetencoders 2178 a–b.

FIG. 21D shows a functional block diagram of the data paths with nativemode reception components of the bus translator according to oneembodiment of the present invention. In one embodiment, the bustranslator 2102 can be configured into native mode. Native mode caninclude when a total of 10 Gbps connections are maintained at theparallel end (as shown by CMOS I/Os 2112) of the bus translator 2102. Inone embodiment, due to the increased bandwidth requirement (from 8 Gbpsto 10 Gbps), the cell format length is no longer fixed at 32 bytes. Inembodiments where a 10 Gbps traffic is channeled through the bustranslator 2102, control information is attached when the bus translator2102 receives a SOP from the device(s) on the 10 Gbps link. In anadditional embodiment, when the bus translator 2102 first detects a datatransfer and is, therefore, coming to an operational state from idle, itattaches control information.

In an additional embodiment, as shown in FIG. 21D, two separate dataFIFOs are used to temporarily buffer the uplinking data; thus avoidingexisting timing paths.

Although a separate native mode data path is not shown for cell topacket translation, one skilled in the relevant art would recognize howto accomplish it based at least on the teachings described herein. Forexample, by configuring two FIFOs for dedicated storage of 10 Gbps linkinformation. In one embodiment, however, the bus translator 2102processes native mode and non-native mode data paths in a sharedoperation as shown in FIGS. 19, 20, and 21. Headers and idle bytes arestripped from the data stream by the cell decoder(s), such as decoder(s)2103 and 2174. Valid data is parsed and stored, and forwarded, aspreviously described, to the parallel interface.

In an additional embodiment, where there is a zero body cell formatbeing received by the interface adapter or BIA, the IBT 304 holds onelast data transfer for each source slot. When it receives the EOP withthe zero body cell format, the last one or two transfers are released tobe transmitted from the parallel interface.

S. Narrow Cell and Packet Encoding Processes

FIG. 21E shows a block diagram of a cell format according to oneembodiment of the present invention. FIG. 21E shows both an examplepacket and a cell according to the embodiments described herein. Theexample packet shows a start of packet 2190 a, payload containing data2190 b, end of packet 2190 c, and inter-packet gap 2190 c.

According to one embodiment of the present invention, the cell includesa special character K0 2190; a control information 2194; optionally, oneor more reserved 2196 a–b; and data 2198 a–n. In an alternateembodiment, data 2198 a–n can contain more than D0–D31.

In one embodiment, the four rows or slots indicated in FIG. 21Eillustrate the four lanes of the serial link through which the cells aretransmitted and/or received.

As previously described herein, the IBT 304 transmits and receives cellsto and from the BIA 302 through the XAUI interface. The IBT 304transmits and receives packets to and from the IPC/IGC components, aswell as other controller components (i.e., 10 GE packet processor)through a parallel interface. The packets are segmented into cells whichconsist of a four byte header followed by 32 bytes of data. The end ofpacket is signaled by K1 special character on any invalid data byteswithin four byte of transfer or four K1 on all XAUI lanes. In oneembodiment, each byte is serialized onto one XAUI lane. The followingtable illustrates in a right to left formation a byte by byterepresentation of a cell according to one embodiment of the presentinvention:

Lane0 Lane1 Lane2 Lane3 K0 State Reserved Reserved D0 D1 D2 D3 D4 D5 D6D7 D8 D9 D10 D11 D12 D13 D14 D15 . . . . . . . . . . . . D28 D29 D30 D31

The packets are formatted into cells that consist of a header plus adata payload. The 4 bytes of header takes one cycle or row on four XAUIlanes. It has K0 special character on Lane0 to indicate that currenttransfer is a header. The control information starts on Lane1 of aheader.

In one embodiment, the IBT 304 accepts two IPC/IGC back plane buses andtranslates them into one 10 Gbps serial stream.

In FIG. 22, a flow diagram of the encoding process of the bus translatoraccording to one embodiment of the present invention is shown. Theprocess starts at step 2202 and immediately proceeds to step 2204.

In step 2204, the IBT 304 determines the port types through which itwill be receiving packets. In one embodiment, the ports are configuredfor 4 Gbps traffic from IPC/IGC components. The process immediatelyproceeds to step 2206.

In step 2206, the IBT 304 selects a cell format type based on the typeof traffic it will be processing. In one embodiment, the IBT 304 selectsthe cell format type based in part on the port type determination ofstep 2204. The process immediately proceeds to step 2208.

In step 2208, the IBT 304 receives one or more packets from through itsports from the interface connections, as previously described. The rateat which packets are delivered depends on the components sending thepackets. The process immediately proceeds to step 2210.

In step 2210, the IBT 304 parses the one or more packets received instep 2208 for the information contained therein. In one embodiment, thepacket decoder(s) of the IBT 304 parse the packets for the informationcontained within the payload section of the packet, as well as thecontrol or routing information included with the header for that eachgiven packet. The process immediately proceeds to step 2212.

In step 2212, the IBT 304 optionally stores the information parsed instep 2210. In one embodiment, the memory pool(s) of the IBT 304 areutilized to store the information. The process immediately proceeds tostep 2214.

In step 2214, the IBT 304 formats the information into one or morecells. In one embodiment, the cell encoder(s) of the IBT 304 access theinformation parsed from the one or more packets. The informationincludes the data being trafficked as well as slot and state information(i.e., control information) about where the data is being sent. Aspreviously described, the cell format includes special characters whichare added to the information. The process immediately proceeds to step2216.

In step 2216, the IBT 304 forwards the formatted cells. In oneembodiment, the SERDES of the IBT 304 receives the formatted cells andserializes them for transport to the BIA 302 of the present invention.The process continues until instructed otherwise.

In FIGS. 23A–B, a detailed flow diagram shows the encoding process ofthe bus translator according to one embodiment of the present invention.The process of FIGS. 23A–B begins at step 2302 and immediately flows tostep 2304.

In step 2304, the IBT 304 determines the port types through which itwill be receiving packets. The process immediately proceeds to step2306.

In step 2306, the IBT 304 determines if the port type will, eitherindividually or in combination, exceed the threshold that can bemaintained. In other words, the IBT 304 checks to see if it can matchthe line rate of incoming packets without reaching the internal ratemaximum. If it can, then the process proceeds to step 2310. In not, thenthe process proceeds to step 2308.

In step 2308, given that the IBT 304 has determined that it will beoperating at its highest level, the IBT 304 selects a variable cell sizethat will allow it to reduce the number of cells being formatted andforwarded in the later steps of the process. In one embodiment, the cellformat provides for cells of whole integer multiples of each of the oneor more packets received. In another embodiment, the IBT 304 selects acell format that provides for a variable cell size that allows formaximum length cells to be delivered until the packet is completed. Forexample, if a given packet is 2.3 cell lengths, then three cells will beformatted, however, the third cell will be a third that is the size ofthe preceding two cells. The process immediately proceeds to step 2312.

In step 2310, given that the IBT 304 has determined that it will not beoperating at its highest level, the IBT 304 selects a fixed cell sizethat will allow the IBT 304 to process information with lower processingoverhead. The process immediately proceeds to step 2312.

In step 2312, the IBT 304 receives one or more packets. The processimmediately proceeds to step 2314.

In step 2314, the IBT 304 parses the control information from each ofthe one or more packets. The process immediately proceeds to step 2316.

In step 2316, the IBT 304 determines the slot and state information foreach of the one or more packets. In one embodiment, the slot and stateinformation is determined in part from the control information parsedfrom each of the one or more packets. The process immediately proceedsto step 2318.

In step 2318, the IBT 304 stores the slot and state information. Theprocess immediately proceeds to step 2320.

In step 2320, the IBT 304 parses the payload of each of the one or morepackets for the data contained therein. The process immediately proceedsto step 2322.

In step 2322, the IBT 304 stores the data parsed from each of the one ormore packets. The process immediately proceeds to step 2324.

In step 2324, the IBT 304 accesses the control information. In oneembodiment, the cell encoder(s) of the IBT 304 access the memory pool(s)of the IBT 304 to obtain the control information. The processimmediately proceeds to step 2326.

In step 2326, the IBT 304 accesses the data parsed from each of the oneor more packets. In one embodiment, the cell encoder(s) of the IBT 304access the memory pool(s) of the IBT 304 to obtain the data. The processimmediately proceeds to step 2328.

In step 2328, the IBT 304 constructs each cell by inserting a specialcharacter at the beginning of the cell currently being constructed. Inone embodiment, the special character is K0. The process immediatelyproceeds to step 2330.

In step 2330, the IBT 304 inserts the slot information. In oneembodiment, the IBT 304 inserts the slot information into the next lane,such as space 2194. The process immediately proceeds to step 2332.

In step 2332, the IBT 304 inserts the state information. In oneembodiment, the IBT 304 inserts the state information into the next laneafter the one used for the slot information, such as reserved 2196 a.The process immediately proceeds to step 2334.

In step 2334, the IBT 304 inserts the data. The process immediatelyproceeds to step 2336.

In step 2336, the IBT 304 determines if there is additional data to beformatted. For example, if there is remaining data from a given packet.If so, then the process loops back to step 2328. If not, then theprocess immediately proceeds to step 2338.

In step 2338, the IBT 304 inserts the special character that indicatedthe end of the cell transmission (of one or more cells). In oneembodiment, when the last of a cells is transmitted, the specialcharacter is K1. The process proceeds to step 2340.

In step 2340, the IBT 304 forwards the cells. The process continuesuntil instructed otherwise.

In FIG. 24, a flow diagram illustrates the decoding process of the bustranslator according to one embodiment of the present invention. Theprocess of FIG. 24 begins at step 2402 and immediately proceeds to step2404.

In step 2404, the IBT 304 receives one or more cells. In one embodiment,the cells are received by the SERDES of the IBT 304 and forwarded to thecell decoder(s) of the IBT 304. In another embodiment, the SERDES of theIBT 304 forwards the cells to a synchronization buffer or queue thattemporarily holds the cells so that their proper order can bemaintained. These steps are described below with regard to steps 2406and 2408. The process immediately proceeds to step 2406.

In step 2406, the IBT 304 synchronizes the one or more cells into theproper order. The process immediately proceeds to step 2408.

In step 2408, the IBT 304 optionally checks the one or more cells todetermine if they are in their proper order.

In one embodiment, steps 2506, 2508, and 2510 are performed by asynchronization FIFO. The process immediately proceeds to step 2410.

In step 2410, the IBT 304 parses the one or more cells into controlinformation and payload data. The process immediately proceeds to step2412.

In step 2412, the IBT 304 stores the control information payload data.The process immediately proceeds to step 2414.

In step 2414, the IBT 304 formats the information into one or morepackets. The process immediately proceeds to step 2416.

In step 2416, the IBT 304 forwards the one or more packets. The processcontinues until instructed otherwise.

In FIGS. 25A–B, a detailed flow diagram of the decoding process of thebus translator according to one embodiment of the present invention isshown. The process of FIGS. 25A–B begins at step 2502 and immediatelyproceeds to step 2504.

In step 2504, the IBT 304 receives one or more cells. The processimmediately proceeds to step 2506.

In step 2506, the IBT 304 optionally queues the one or more cells. Theprocess immediately proceeds to step 2508.

In step 2508, the IBT 304 optionally determines if the cells arearriving in the proper order. If so, then the process immediatelyproceeds to step 2512. If not, then the process immediately proceeds tostep 2510.

In step 2510, The IBT 304 holds one or more of the one or more cellsuntil the proper order is regained. In one embodiment, in the event thatcells are lost, the IBT 304 provide error control functionality, asdescribed herein, to abort the transfer and/or have the transferre-initiated. The process immediately proceeds to step 2514.

In step 2512, the IBT 304 parses the cell for control information. Theprocess immediately proceeds to step 2514.

In step 2514, the IBT 304 determines the slot and state information. Theprocess immediately proceeds to step 2516.

In step 2516, the IBT 304 stores the slot and state information. Theprocess immediately proceeds to step 2518.

In one embodiment, the state and slot information includes configurationinformation as shown in the table below:

Field Name Description State [3:0] Slot Destination slot number from IBTto SBIA. Number IPC can address 10 slots(7 remote, 3 local) and IGC canaddress 14 slots (7 remote and 7 local) State [5:4] Payload Encodepayload state: 00 - RESERVED State 01 - SOP 10 - DATA 11 - ABORT State[6] Source/ Encode source/destination IPC id number: Destination  0 -to/from IPC0 IPC  1 - to/from IPC1 State [7] Reserved Reserved

In one embodiment, the IBT 304 has configuration registers. They areused to enable Backplane and IPC/IGC destination slots.

In step 2518, the IBT 304 parses the cell for data. The processimmediately proceeds to step 2520.

In step 2520, the IBT 304 stores the data parsed from each of the one ormore cells. The process immediately proceeds to step 2522.

In step 2522, the IBT 304 accesses the control information. The processimmediately proceeds to step 2524.

In step 2524, the IBT 304 access the data. The process immediatelyproceeds to step 2526.

In step 2526, the IBT 304 forms one or more packets. The processimmediately proceeds to step 2528.

In step 2528, the IBT 304 forwards the one or more packets. The processcontinues until instructed otherwise.

T. Administrative Process and Error Control

In FIG. 26, a flow diagram shows the administrating process of the bustranslator according to one embodiment of the present invention. Theprocess of FIG. 26 begins at step 2602 and immediately proceeds to step2604.

In step 2604, the IBT 304 determines the status of its internalcomponents. The process immediately proceeds to step 2606.

In step 2606, the IBT 304 determines the status of its links to externalcomponents. The process immediately proceeds to step 2608.

In step 2608, the IBT 304 monitors the operations of both the internaland external components. The process immediately proceeds to step 2610.

In step 2610, the IBT 304 monitors the registers for administrativecommands. The process immediately proceeds to step 2612.

In step 2612, the IBT 304 performs resets of given components asinstructed. The process immediately proceeds to step 2614.

In step 2614, the IBT 304 configures the operations of given components.The process continues until instructed otherwise.

In one embodiment, any errors are detected on the receiving side of theBIA 302 are treated in a fashion identical to the error control methodsdescribed herein for errors received on the Xpnt 202 from the BIA 302.In operational embodiments where the destination slot cannot be knowunder certain conditions by the BIA 302, the following process isfollowed:

a. Send an abort of packet (AOP) to all slots.

b. Wait for error to go away.

C. Sync to K0 token after error goes away to begin accepting data.

In the event that an error is detected on the receiving side of the IBT304, it is treated as if the error was seen by the BIA 302 from IBT 304.The following process will be used:

a. Send an AOP to all slots of down stream IPC/IGC to terminate anypacket in progress.

b. Wait for error to go away.

c. Sync to K0 token after error goes away to begin accepting data.

U. Reset and Recovery Procedures

The following reset procedure will be followed to get the SERDES insync. An external reset will be asserted to the SERDES core when a resetis applied to the core. The duration of the reset pulse for the SERDESneed not be longer than 10 cycles. After reset pulse, the transmitterand the receiver of the SERDES will sync up to each other throughdefined procedure. It is assumed that the SERDES will be in sync oncethe core comes out of reset. For this reason, the reset pulse for thecore must be considerably greater than the reset pulse for the SERDEScore.

The core will rely on software interaction to get the core in sync. Oncethe BIA 302, 600, IBT 304, and Xpnt 202 come out of reset, they willcontinuously send lane synchronization sequence. The receiver will set asoftware visible bit stating that its lane is in sync. Once softwaredetermines that the lanes are in sync, it will try to get the stripes insync. This is done through software which will enable continuouslysending of stripe synchronization sequence. Once again, the receivingside of the BIA 302 will set a bit stating that it is in sync with aparticular source slot. Once software determines this, it will enabletransmit for the BIA 302, XPNT 202 and IBT 304.

IV. Control Logic

Functionality described above with respect to the operation of switch100 can be implemented in control logic. Such control logic can beimplemented in software, firmware, hardware or any combination thereof.

V. Conclusion

While specific embodiments of the present invention have been describedabove, it should be understood that they have been presented by way ofexample only, and not limitation. It will be understood by those skilledin the art that various changes in form and details may be made thereinwithout departing from the spirit and scope of the invention as definedin the appended claims. Thus, the breadth and scope of the presentinvention should not be limited by any of the above-described exemplaryembodiments, but should be defined only in accordance with the followingclaims and their equivalents.

1. A method for encoding wide striped cells that carry packets of dataacross stripes, comprising: (a) encoding an initial block of a firstwide striped cell with initial cell encoding information; (b)distributing initial bytes of packet data into available space in theinitial block of the first wide striped cell; and (c) encoding the firstwide striped cell or another wide striped cell with end of packetinformation that varies depending upon the degree to which data hasfilled the first wide striped cell or another wide striped cell.
 2. Themethod of claim 1, wherein said initial cell encoding informationincludes control information and state information, and said initialblock of the first wide striped cell comprises five subblockscorresponding to five stripes, and wherein each subblock includesidentical control information and identical state information.
 3. Themethod of claim 1, further comprising adding reserve information toavailable bytes at the end of the initial block of the first widestriped cell.
 4. The method of claim 1, further comprising distributingremaining bytes of packet data across one or more blocks in the firstwide striped cell until an end of packet condition is reached or amaximum cell size is reached.
 5. The method of claim 1, furthercomprising: (c) encoding the first wide striped cell or another widestriped cell with end of packet information, the end of packetinformation varying depending upon a set of end of packet conditionsincluding whether the end of packet occurs at the end of an initialblock, at the end of the initial block, within a subsequent block, at ablock boundary, or at a cell boundary.
 6. The method of claim 1, whereinsaid initial block encoding step (a), at the start of a packet, encodesan initial twenty byte block of a start wide striped cell having twentybytes of data distributed across five stripes as follows: Block Stripe 1Stripe 2 Stripe 3 Stripe 4 Stripe 5 1 KO KO KO KO KO STATE STATE STATESTATE STATE DATAO DATA2 DATA4 DATA6 RES DATA1 DATA3 DATA5 DATA7 RES

where, KO is one byte representing a special control characterindicative of a cell start, STATE is one byte of state information,DATA0–DATA7 represent eight bytes of payload data, and RES is onereserved byte.
 7. A system for encoding wide striped cells that carrypackets of data across stripes, comprising: (a) means for encoding aninitial block of a first wide striped cell with initial cell encodinginformation; (b) means for distributing initial bytes of packet datainto available space in the initial block of the first wide stripedcell; and (c) means for encoding the first wide striped cell or anotherwide striped cell with end of packet information that varies dependingupon the degree to which data has filled the first wide striped cell oranother wide striped cell.
 8. The system of claim 7, wherein saidinitial cell encoding information includes control information and stateinformation, and said initial block of the first wide striped cellcomprises five subblocks corresponding to five stripes, and wherein eachsubblock includes identical control information and identical stateinformation.
 9. The system of claim 7, further comprising means foradding reserve information to available bytes at the end of the initialblock of the first wide striped cell.
 10. The system of claim 7, furthercomprising means for distributing remaining bytes of packet data acrossone or more blocks in the first wide striped cell until an end of packetcondition is reached or a maximum cell size is reached.
 11. The systemof claim 7, further comprising: (c) means for encoding the first widestriped cell or another wide striped cell with end of packetinformation, the end of packet information varying depending upon a setof end of packet conditions including whether the end of packet occursat the end of the initial block, within a subsequent block, at a blockboundary, or at a cell boundary.
 12. The system of claim 7, wherein saidinitial block encoding means (a), at the start of a packet, encodes aninitial twenty byte block of a start wide striped cell having twentybytes of data distributed across five stripes as follows: Block Stripe 1Stripe 2 Stripe 3 Stripe 4 Stripe 5 1 KO KO KO KO KO STATE STATE STATESTATE STATE DATAO DATA2 DATA4 DATA6 RES DATA1 DATA3 DATA5 DATA7 RES

where, KO is one byte representing a special control characterindicative of a cell start, STATE is one byte of state information,DATA0–DATA7 represent eight bytes of payload data, and RES is onereserved byte.
 13. The method of claim 1, wherein the end of packetinformation varies depending upon a set of end packet conditions. 14.The method of claim 13, wherein said end of packet conditions includewhere the end of packet occurs.
 15. The system of claim 7, wherein theend of packet information varies depending upon a set of end packetconditions.
 16. The system of claim 7, wherein said end of packetconditions include where the end of packet occurs.
 17. A program storagedevice readable by a machine, tangibly embodying a program ofinstructions executable by the machine to perform a method for encodingwide striped cells that carry packets of data across stripes, the methodcomprising: (a) encoding an initial block of a first wide striped cellwith initial cell encoding information; (b) distributing initial bytesof packet data into available space in the initial block of the firstwide striped cell; and (c) encoding the first wide striped cell oranother wide striped cell with end of packet information that variesdepending upon the degree to which data has filled the first widestriped cell or another wide striped cell.
 18. A program storage devicereadable by a machine, tangibly embodying a program of instructionsexecutable by the machine to perform a method for encoding wide stripedcells that carry packets of data across stripes, the method comprising:(a) encoding an initial block of a first wide striped cell with initialcell encoding information; (b) distributing initial bytes of packet datainto available space in the initial block of the first wide stripedcell; and (c) encoding the first wide striped cell or another widestriped cell with end of packet information, the end of packetinformation varying depending upon a set of end of packet conditionsincluding whether the end of packet occurs at the end of the initialblock, within a subsequent block, at a block boundary, or at a cellboundary.